Problem: Monocarp has arranged n colored marbles in a row. The color of the i-th marble is a_i. Monocarp likes ordered things, so he wants to rearrange marbles in such a way that all marbles of the same color form a contiguos segment (and there is only one such segment for each color). 

In other words, Monocarp wants to rearrange marbles so that, for every color j, if the leftmost marble of color j is l-th in the row, and the rightmost marble of this color has position r in the row, then every marble from l to r has color j.

To achieve his goal, Monocarp can do the following operation any number of times: choose two neighbouring marbles, and swap them.

You have to calculate the minimum number of operations Monocarp has to perform to rearrange the marbles. Note that the order of segments of marbles having equal color does not matter, it is only required that, for every color, all the marbles of this color form exactly one contiguous segment.

Input

The first line contains one integer n (2 ≤ n ≤ 4 ⋅ 10^5) — the number of marbles.

The second line contains an integer sequence a_1, a_2, ..., a_n (1 ≤ a_i ≤ 20), where a_i is the color of the i-th marble.

Output

Print the minimum number of operations Monocarp has to perform to achieve his goal.

Examples

Input


7
3 4 2 3 4 2 2


Output


3


Input


5
20 1 14 10 2


Output


0


Input


13
5 5 4 4 3 5 7 6 5 4 4 6 5


Output


21

Note

In the first example three operations are enough. Firstly, Monocarp should swap the third and the fourth marbles, so the sequence of colors is [3, 4, 3, 2, 4, 2, 2]. Then Monocarp should swap the second and the third marbles, so the sequence is [3, 3, 4, 2, 4, 2, 2]. And finally, Monocarp should swap the fourth and the fifth marbles, so the sequence is [3, 3, 4, 4, 2, 2, 2]. 

In the second example there's no need to perform any operations.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
long long dp[(1 << 20) + 66];
long long f[maxn + 6][maxn + 6];
long long sum[26];
int cnt[26];
int n, a[400006];
bool mybool[26];
set<int> Set;
set<int>::iterator it;
map<int, int> Map;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), Set.insert(a[i]);
  int m = 0;
  for (it = Set.begin(); it != Set.end(); ++it) {
    ++m;
    Map[*it] = m;
  }
  for (int i = 1; i <= n; i++) a[i] = Map[a[i]];
  for (int i = n; i > 0; i--) {
    cnt[a[i]]++;
    sum[a[i]] += i;
    for (int j = 1; j <= m; j++) {
      if (a[i] != j) {
        f[a[i]][j] += cnt[j];
      }
    }
  }
  memset(dp, 0x3f, sizeof(dp));
  dp[0] = 0;
  for (int i = 0; i < (1 << m) - 1; i++) {
    long long left = 0;
    for (int j = 0; j < m; j++) {
      if (i & (1 << j)) left += cnt[j + 1];
    }
    for (int j = 0; j < m; j++) {
      if (i & (1 << j)) continue;
      long long ttmp = sum[j + 1];
      for (int k = 0; k < m; k++) {
        if (i & (1 << k)) {
          ttmp += f[j + 1][k + 1];
        }
      }
      long long tmp = ttmp - left * cnt[j + 1] -
                      (long long)cnt[j + 1] * (cnt[j + 1] + 1) / 2;
      assert(tmp >= 0);
      dp[i | (1 << j)] = min(dp[i | (1 << j)], dp[i] + tmp);
    }
  }
  printf("%lld", dp[(1 << m) - 1]);
  return 0;
}