#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000;
int main(){
  int N;
  cin >> N;
  vector<int> P(N);
  for (int i = 0; i < N; i++){
    cin >> P[i];
    P[i]--;
  }
  vector<int> dpL(N, INF);
  vector<int> L(N, 0);
  for (int i = 0; i < N; i++){
    L[i] = lower_bound(dpL.begin(), dpL.end(), P[i]) - dpL.begin();
    dpL[L[i]] = P[i];
  }
  vector<int> Q(N);
  for (int i = 0; i < N; i++){
    Q[i] = N - 1 - P[i];
  }
  vector<int> dpR(N, INF);
  vector<int> R(N, 0);
  vector<int> pr(N);
  for (int i = N - 1; i >= 0; i--){
    R[i] = lower_bound(dpR.begin(), dpR.end(), Q[i]) - dpR.begin();
    pr[i] = N - 1 - dpR[R[i]];
    if (pr[i] < 0){
      pr[i] = -INF;
    }
    dpR[R[i]] = Q[i];
  }
  int lis = lower_bound(dpL.begin(), dpL.end(), INF) - dpL.begin();
  vector<int> A(lis + 1, INF), B(lis + 1, -INF);
  A[0] = -INF;
  B[lis] = INF;
  for (int i = N - 1; i >= 0; i--){
    B[lis - 1 - R[i]] = P[i];
  }
  int cnt = 0;
  for (int i = 0; i <= lis; i++){
    if (A[i] < B[i]){
      cnt++;
    }
  }
  vector<int> ans;
  for (int i = 0; i < N; i++){
    if (A[lis - 1 - R[i]] < B[lis - 1 - R[i]]){
      cnt--;
    }
    B[lis - 1 - R[i]] = pr[i];
    if (A[lis - 1 - R[i]] < B[lis - 1 - R[i]]){
      cnt++;
    }
    if (cnt == 0){
      ans.push_back(P[i]);
    }
    if (A[L[i] + 1] < B[L[i] + 1]){
      cnt--;
    }
    A[L[i] + 1] = P[i];
    if (A[L[i] + 1] < B[L[i] + 1]){
      cnt++;
    }
  }
  int x = ans.size();
  cout << x << endl;
  for (int i = 0; i < x; i++){
    cout << ans[i] + 1;
    if (i <x - 1){
      cout << ' ';
    }
  }
  cout << endl;
}