#include<bits/stdc++.h>
// #include<atcoder/all>
// #include<boost/multiprecision/cpp_int.hpp>

using namespace std;
// using namespace atcoder;
// using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(c) ((ll)(c).size())
#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())
#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())
// #define MOD 1000000007
#define MOD 998244353
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}



int main(){
  
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n;
  cin >> n;
  vi p(n);
  cin >> p;
  rep(i,n)p[i]--;
  auto calc = [](vi &a)->vi{
    int n = sz(a);
    vi lis(n,MOD);
    vi mem(n);
    rep(i,n){
      int k = LB(lis,a[i]);
      mem[i] = k;
      lis[k] = a[i];
    }
    vi mn(n,MOD);
    int mxmx = *max_element(ALL(mem));
    for(int i = n-1;i >= 0;i--){
      if(mem[i] == mxmx){
        mn[mem[i]] = a[i];
        mxmx--;
      }
    }
    while(mn.back() == MOD)mn.pop_back();
    return mn;
  };
  vi mn = calc(p);
  reverse(ALL(p));
  rep(i,n)p[i] = -p[i];
  vi mx = calc(p);
  rep(i,n)mx[i] = -mx[i];
  reverse(ALL(mx));
  vi res;
  rep(i,sz(mn)){
    if(mn[i] == mx[i])res.emplace_back(mx[i]+1);
  }
  cout << sz(res) << "\n";
  cout << res << "\n";
  // cout << mn << " a\n";
  // cout << mx << " b\n";

  

  return 0;
}