#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
using namespace std;  
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vvp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
ll gcd(ll x,ll y){
    if(y==0)return x;
    return gcd(y,x%y);
}
 
ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
ll mod =998244353;
//ll mod =1e9+7;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    if (n<0) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(2000000); 
using vm=vector<mint> ;
using vvm=vector<vm> ;
struct edge{
  int to; ll cost;
  edge(int to,ll cost) : to(to),cost(cost){}
};
using ve=vector<edge>;
using vve=vector<ve>;
struct Compress{
   vll a;
   map<ll,ll> d,d2;
   int cnt;
   Compress() :cnt(0) {}
   void add(ll x){a.push_back(x);}
   void init(){
     set<ll>s(a.begin(),a.end());
     for(auto y:s)d[y]=cnt++;
     for(auto&y:a)y=d[y];
     for(auto u:d)d2[u.second]=u.first;
   }
   ll to(ll x){return d[x];} //変換先
   ll from(ll x){return d2[x];}//逆引き
   int size(){return cnt;}
};
vll anss;
using S=ll;
S op(S a,S b){return max(a,b);}
S e(){return -inf;}
void solve(int test){
  int n; cin >> n;
  vi p(n);rep(i,n)cin >> p[i],p[i]--;
  Compress comp;
  rep(i,n)comp.add(p[i]);
  comp.init();
  int m=comp.size();
  rep(i,n)p[i]=comp.to(p[i]);
  vll maxv(n,1);
  vll maxv2(n,1);
  ll L=-1;
  mint tot=0;
  vm num(n,1);
  {
    segtree<S,op,e> seg(m);
    seg.set(p[0],maxv[0]);
    repi(i,1,n){
      chmax(maxv[i],seg.prod(0,p[i])+1);
      seg.set(p[i],op(seg.get(p[i]),maxv[i]));
    }
    chmax(L,seg.all_prod());
    vvi g(n+1);
    rep(i,n)g[maxv[i]].push_back(i);
    fenwick_tree<ll> fw(m);
    vll dp(n);
    rep(i,n)if(maxv[i]==1)dp[i]=1;
    repi(i,1,L-1+1){
      vi vs;
      for(auto u:g[i])vs.push_back(u);
      for(auto u:g[i+1])vs.push_back(u);
      sort(vs.begin(),vs.end());
      for(auto id:vs){
        if(maxv[id]==i){
          fw.add(p[id],dp[id]);
        }
        else {
          dp[id]=fw.sum(0,p[id]);
        }
      }
      for(auto id:vs){
        if(maxv[id]==i){
          fw.add(p[id],-dp[id]);
        }
      }
    }
    rep(i,n)if(maxv[i]==L)tot+=dp[i];
    rep(i,n)num[i]*=dp[i];
  }
  {
    segtree<S,op,e> seg(m);
    seg.set(p[n-1],maxv2[n-1]);
    for(int i=n-2; i>=0; i--){
      chmax(maxv2[i],seg.prod(p[i]+1,m)+1);
      seg.set(p[i],op(seg.get(p[i]),maxv2[i]));
    }
    vvi g(n+1);
    rep(i,n)g[maxv2[i]].push_back(i);
    fenwick_tree<ll> fw(m);
    vll dp(n);
    rep(i,n)if(maxv2[i]==1)dp[i]=1;
    repi(i,1,L-1+1){
      vi vs;
      for(auto u:g[i])vs.push_back(u);
      for(auto u:g[i+1])vs.push_back(u);
      sort(vs.rbegin(),vs.rend());
      for(auto id:vs){
        if(maxv2[id]==i){
          fw.add(p[id],dp[id]);
        }
        else {
          dp[id]=fw.sum(p[id]+1,m);
        }
      }
      for(auto id:vs){
        if(maxv2[id]==i){
          fw.add(p[id],-dp[id]);
        }
      }
    }
    rep(i,n)num[i]*=dp[i];
  }
  vi ans;
  rep(i,n)if(maxv[i]+maxv2[i]==L+1){
    if(num[i].x==tot.x)ans.push_back(p[i]+1);
  }
  cout << ans.size() << endl;
  for(auto u:ans)cout << u << " ";
  cout << endl;
}
//g++ main.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
  int t=1;//cin >> t;
  rep(test,t)solve(test);
  for(auto u:anss)cout << u << endl;
}