You are given an array a consisting of n non-negative integers. You have to choose a non-negative integer x and form a new array b of size n according to the following rule: for all i from 1 to n, b_i = a_i ⊕ x (⊕ denotes the operation [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR)).

An inversion in the b array is a pair of integers i and j such that 1 ≤ i < j ≤ n and b_i > b_j.

You should choose x in such a way that the number of inversions in b is minimized. If there are several options for x — output the smallest one.

Input

First line contains a single integer n (1 ≤ n ≤ 3 ⋅ 10^5) — the number of elements in a.

Second line contains n space-separated integers a_1, a_2, ..., a_n (0 ≤ a_i ≤ 10^9), where a_i is the i-th element of a.

Output

Output two integers: the minimum possible number of inversions in b, and the minimum possible value of x, which achieves those number of inversions.

Examples

Input


4
0 1 3 2


Output


1 0


Input


9
10 7 9 10 7 5 5 3 5


Output


4 14


Input


3
8 10 3


Output


0 8

Note

In the first sample it is optimal to leave the array as it is by choosing x = 0.

In the second sample the selection of x = 14 results in b: [4, 9, 7, 4, 9, 11, 11, 13, 11]. It has 4 inversions:

  * i = 2, j = 3; 
  * i = 2, j = 4; 
  * i = 3, j = 4; 
  * i = 8, j = 9. 



In the third sample the selection of x = 8 results in b: [0, 2, 11]. It has no inversions.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Main {
  static class FastScanner {
    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st=new StringTokenizer("");
    String next() {
      while (!st.hasMoreTokens())
        try { 
          st=new StringTokenizer(br.readLine());                       
        } catch (IOException e) {}
      return st.nextToken();
    }

    int nextInt() {
      return Integer.parseInt(next());
    }
    long nextLong() {
      return Long.parseLong(next());
    }
  }
  
  public static void test() {
    int[] input = new int[] {0, 1, 3, 2};
    Main m = new Main(input);
    m.solve();
  }
 
  public static void main(String[] args) {
    //test();
    FastScanner sc = new FastScanner();
    int n = sc.nextInt();
    int[] nums = new int[n];
    for (int i = 0; i < n; i++) {
      nums[i] = sc.nextInt();
    }
    Main m = new Main(nums);
    int solve = m.solve();
    System.out.println(String.format("%d %d", m.inversionCount, solve));
  }
  
  long inversionCount = 0;
  List<Integer> start;
  int[] nums;
  ArrayList<int[]> ranges = new ArrayList<>();
  public Main(int[] nums) {
    this.nums = nums;
  }
  
  public int solve() {
    inversionCount = 0;
    ranges.clear();
    ranges.add(nums);
    
    int solve = 0;
    for (int i = 30; i >= 0; i--) {
      long zero = countInversion(i, false);
      long one = countInversion(i, true);
      if (one < zero) {
        solve += (1 << i);
      }
      inversionCount += Math.min(zero, one);
      split(i);
    }
    return solve;
  }
  
  public void split(int index) {
    ArrayList<int[]> nextRanges = new ArrayList<>();
    for (int[] range : ranges) {
      ArrayList<Integer> zeroes = new ArrayList<>();
      ArrayList<Integer> ones = new ArrayList<>();
      
      for (int x : range) {
        if (((x >> index) & 1) == 0) {
          zeroes.add(x);
        } else {
          ones.add(x);
        }
      }
      if (!zeroes.isEmpty()) {
        int[] arr = new int[zeroes.size()];
        for (int i = 0; i < zeroes.size(); i++) {
          arr[i] = zeroes.get(i);
        }
        nextRanges.add(arr);
      }
      if (!ones.isEmpty()) {
        int[] arr = new int[ones.size()];
        for (int i = 0; i < ones.size(); i++) {
          arr[i] = ones.get(i);
        }
        nextRanges.add(arr);
      }
    }
    ranges = nextRanges;
  }
  
  public long countInversion(int index, boolean swap) {
    long numInversion = 0;
    
    for (int[] r : ranges) {
      numInversion += countInversion(index, swap, r);
    }
    
    return numInversion;
  }
  
  public long countInversion(int index, boolean swap, int[] r) {
    long numInversions = 0;
    int[] bits = new int[r.length];
    for (int i = 0; i < r.length; i++) {
      int x = r[i];
      bits[i] = (((x >> index) ^ (swap ? 1 : 0)) & 1);
    }
    
    int count0s = 0;
    for (int i = bits.length - 1; i >= 0; i--) {
      if (bits[i] == 0) {
        count0s++;
      } else {
        numInversions += count0s;
      }
    }
    return numInversions;
  }
}