Problem: Once Bob saw a string. It contained so many different letters, that the letters were marked by numbers, but at the same time each letter could be met in the string at most 10 times. Bob didn't like that string, because it contained repeats: a repeat of length x is such a substring of length 2x, that its first half coincides character by character with its second half. Bob started deleting all the repeats from the string. He does it as follows: while it's possible, Bob takes the shortest repeat, if it is not unique, he takes the leftmost one, and deletes its left half and everything that is to the left of this repeat.

You're given the string seen by Bob. Find out, what it will look like after Bob deletes all the repeats in the way described above.

Input

The first input line contains integer n (1 ≤ n ≤ 105) — length of the string. The following line contains n space-separated integer numbers from 0 to 109 inclusive — numbers that stand for the letters of the string. It's guaranteed that each letter can be met in the string at most 10 times.

Output

In the first line output the length of the string's part, left after Bob's deletions. In the second line output all the letters (separated by a space) of the string, left after Bob deleted all the repeats in the described way.

Examples

Input

6
1 2 3 1 2 3


Output

3
1 2 3 


Input

7
4 5 6 5 6 7 7


Output

1
7 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
long long int power(long long int x, long long int b) {
  long long int p = 1;
  while (b > 0) {
    if (b & 1) {
      p = p * x;
      p %= 998244353;
    }
    b >>= 1;
    x *= x;
    x %= 998244353;
  }
  return p % 998244353;
}
std::vector<long long int> fact;
void fact_pre(long long int n = 1100000) {
  fact.resize(n, 1);
  for (long long int i = 2; i < n; i++) fact[i] = (fact[i - 1] * i) % 998244353;
}
long long int ncr(long long int n, long long int r) {
  if (r > n) return 0;
  return (fact[n] * power((fact[n - r] * fact[r]) % 998244353, 998244353 - 2)) %
         998244353;
}
using namespace std;
struct ppp {
  char a;
  long long int b, c, d;
};
long long int N;
struct lex_compare {
  bool operator()(ppp p1, ppp p2) {
    if (p1.a == p2.a) {
      if (p1.b == p2.b)
        return p1.c < p2.c;
      else
        return p1.b < p2.b;
    } else {
      return p1.a < p2.a;
    }
  }
};
long long int base1 = 101, base2 = 31;
long long int hashtotal(vector<long long int> &s, long long int base) {
  long long int ans = 0;
  for (long long int i = 0; i < s.size(); i++) {
    ans += (power(base, i) * s[i]);
    ans %= 998244353;
  }
  return ans;
}
void hashinArray(vector<long long int> &s, long long int base,
                 long long int arr[]) {
  long long int ans = 0;
  for (long long int i = 0; i < s.size(); i++) {
    ans += (power(base, i) * s[i]);
    ans %= 998244353;
    ans += 998244353;
    ans %= 998244353;
    arr[i] = ans;
  }
  return;
}
long long int hashofSubstr(vector<long long int> &s, long long int l,
                           long long int r, long long int arr[],
                           long long int base) {
  long long int temphash = arr[r];
  if (l == 0)
    return temphash;
  else
    temphash -= arr[l - 1];
  temphash += 998244353;
  temphash %= 998244353;
  temphash = temphash * power(power(base, l), 998244353 - 2);
  temphash %= 998244353;
  temphash += 998244353;
  temphash %= 998244353;
  return temphash;
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> arr(n);
  for (long long int i = 0; i < n; i++) cin >> arr[i];
  map<long long int, list<long long int>> m;
  for (long long int i = 0; i < n; i++) {
    m[arr[i]].push_back(i);
  }
  long long int hash1[n], hash2[n];
  hashinArray(arr, base1, hash1);
  hashinArray(arr, base2, hash2);
  long long int rightmostalive = 0;
  long long int gots = 0;
  for (int i = 0; i < n; i++) {
    list<long long int> &v = m[arr[i]];
    while (v.size() > 0 && v.front() <= i) v.pop_front();
    {
      for (auto j : v) {
        long long int len = j - i;
        if (j + len - 1 <= n - 1) {
          long long int h1 = hashofSubstr(arr, i, i + len - 1, hash1, base1);
          long long int h2 = hashofSubstr(arr, j, j + len - 1, hash1, base1);
          long long int h3 = hashofSubstr(arr, i, i + len - 1, hash2, base2);
          long long int h4 = hashofSubstr(arr, j, j + len - 1, hash2, base2);
          if (h1 == h2 && h3 == h4) {
            rightmostalive = j;
            i = j - 1;
            break;
          }
        }
      }
    }
  }
  cout << n - rightmostalive << "\n";
  for (int i = rightmostalive; i < n; i++) {
    cout << arr[i] << " ";
  }
  cout << "\n";
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  solve();
  return 0;
}