#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

int op(int a, int b) {
    return max(a, b);
}

int e() {
    return 0;
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int> v = a;
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    int sz = v.size();
    segtree<int, op, e> seg1(sz), seg2(sz);
    for (int i = 0; i < n; i++) {
        int id = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
        int now = seg2.get(id);
        seg2.set(id, now + 1);
    }
    vector<int> ans;
    for (int i = 0; i < n - 1; i++) {
        int id = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
        int now1 = seg1.get(id);
        seg1.set(id, now1 + 1);
        int now2 = seg2.get(id);
        seg2.set(id, now2 - 1);
        if (seg1.all_prod() <= 1 && seg2.all_prod() <= 1) {
            ans.push_back(i + 1);
        }
    }
    cout << ans.size() << endl;
    for (int x : ans) {
        cout << x << " ";
    }
    cout << endl;
}