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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author htvu
 */
public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    InputReader in = new InputReader(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    EXORInverse solver = new EXORInverse();
    solver.solve(1, in, out);
    out.close();
  }

  static class EXORInverse {
    long[][] dp = new long[30][2];

    public void solve(int testNumber, InputReader in, PrintWriter out) {
      int n = in.nextInt();
//    int n = 300_000;
      int[] a = new int[n];
      EXORInverse.TrieNode root = new EXORInverse.TrieNode();
      for (int i = 0; i < n; ++i) {
        a[i] = in.nextInt();
//      a[i] = ThreadLocalRandom.current().nextInt(1_000_000_000);
//      root.add(a[i], i, dp);
        add(root, a[i], dp);
      }

      long cnt = 0;
      long ans = 0;
      for (int i = 0; i <= 29; ++i) {
        cnt += Math.min(dp[i][0], dp[i][1]);
        if (dp[i][1] < dp[i][0]) {
          ans += (1 << i);
        }
      }
      out.println(cnt + " " + ans);
    }

    private static void add(EXORInverse.TrieNode root, int x, long[][] dp) {
      for (int level = 29; level >= 0; --level) {
        int bit = (x >> level) & 1;
        if (bit == 0) {
          if (root.zero == null) root.zero = new EXORInverse.TrieNode();
          dp[level][0] += root.countOne;
          root.countZero++;
          root = root.zero;
        } else {
          if (root.one == null) root.one = new EXORInverse.TrieNode();
          dp[level][1] += root.countZero;
          root.countOne++;
          root = root.one;
        }
      }
    }

    private static class TrieNode {
      EXORInverse.TrieNode one;
      EXORInverse.TrieNode zero;
      int countOne = 0;
      int countZero = 0;

    }

  }

  static class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
      reader = new BufferedReader(new InputStreamReader(stream), 32768);
      tokenizer = null;
    }

    public String next() {
      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          tokenizer = new StringTokenizer(reader.readLine());
        } catch (IOException e) {
          throw new RuntimeException(e);
        }
      }
      return tokenizer.nextToken();
    }

    public int nextInt() {
      return Integer.parseInt(next());
    }

  }
}

