#include <bits/stdc++.h>
using namespace std;
/*/
#include <atcoder/all>
using namespace atcoder;
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//*/
#define rep(i,n) for(ll i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
#define dbgv(x); for(auto now : x) cout << now << " "; cout << endl;
//using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
//*/
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vint;
random_device rnd;
mt19937 rng(rnd());

void solve(){
  int n; cin >> n;
  vint a(n); rep(i,n) cin >> a[i];
  map<int,int> bac,pre;
  int cnt = 0;
  rep(i,n){
    bac[a[i]]++;
    if(bac[a[i]] == 2) cnt++;
  }
  int ok = true;
  vint ans;
  rep(i,n-1){
    bac[a[i]]--;
    pre[a[i]]++;
    if(pre[a[i]] == 2) ok = false;
    if(bac[a[i]] == 1) cnt--;
    if(ok && cnt==0){
      ans.push_back(i+1);
    }
  }
  cout << ans.size() << endl;
  dbgv(ans);
}
 

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1; //cin >> t;
  rep(testcase,t) solve();
}