#include <bits/stdc++.h>
using namespace std;
const int BASE = 305741, MOD = 1e9 + 7, MAXN = 1e5 + 10;
int a[MAXN], h[MAXN], p[MAXN];
vector<int> num[MAXN], nxt[MAXN];
inline int has(int x, int y) {
  return (h[y] - ((1LL * h[x] * p[y - x]) % MOD) + MOD) % MOD;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  vector<int> vec;
  int n;
  cin >> n;
  p[0] = 1;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    vec.push_back(a[i]);
    p[i + 1] = (1LL * p[i] * BASE) % MOD;
  }
  sort(vec.begin(), vec.end());
  vec.resize(unique(vec.begin(), vec.end()) - vec.begin());
  for (int i = 0; i < n; i++) {
    int id = lower_bound(vec.begin(), vec.end(), a[i]) - vec.begin();
    h[i + 1] = (1LL * h[i] * BASE + id) % MOD;
    for (auto u : num[id]) {
      nxt[u].push_back(i);
    }
    num[id].push_back(i);
  }
  vector<pair<int, int> > ans;
  for (int i = n - 1; i > -1; i--) {
    for (auto j : nxt[i]) {
      if (j - i + j > n) break;
      if (has(i, j) == has(j, j + j - i)) {
        ans.push_back({j - i, i});
      }
    }
  }
  sort(ans.begin(), ans.end());
  int lst = 0;
  for (int i = 0; i < ans.size(); i++) {
    if (ans[i].second >= lst) lst = ans[i].second + ans[i].first;
  }
  cout << n - lst << endl;
  for (int i = lst; i < n; i++) {
    cout << a[i] << ' ';
  }
  cout << endl;
  return 0;
}
