359D

/*
Author: Mehul Chaturvedi
Talent is overrated
*/

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

using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;

#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define vll vector<long long>
#define vvll vector<vector<ll>>
#define vset(v, n, val) v.clear(); v.resize(n, val)
#define INF 4557430888798830399ll
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define trav(a, x) for(auto& a : x)
#define fil(ar, val) memset(ar, val, sizeof(ar))
const ll MOD = 1e9 + 7;


class node {
public:
    ll gcdd;

    node(ll val) {
        gcdd = val;
    }

};

vector<ll> v;
vll anss;
vector<node> t;
vector<ll> t2;
ll n, m;

node help(node left, node right) {
    node res(__gcd(left.gcdd, right.gcdd));
    return res;
}

void build(ll start, ll tl, ll tr) {
    if (tl + 1 == tr) {
        t[start] = node(v[tl]);
        return;
    }

    ll mid = (tl + tr) / 2;
    build(2 * start + 1, tl, mid);
    build(2 * start + 2, mid, tr);
    node left = t[2 * start + 1];
    node right = t[2 * start + 2];
    t[start] =  help(left, right);
    return;
}
void build2(ll start, ll tl, ll tr) {
    if (tl + 1 == tr) {
        t2[start] = v[tl];
        return;
    }
    ll mid = (tl + tr) / 2;
    build2(2 * start + 1, tl, mid);
    build2(2 * start + 2, mid, tr);
    ll left = t2[2 * start + 1];
    ll right = t2[2 * start + 2];
    t2[start] =  min(left, right);
    return;
}

node get(ll start, ll tl, ll tr, ll l, ll r) {
    if (l >= r) return 0;
    if (tl == l && tr == r) return t[start];

    ll mid = (tl + tr) / 2;
    node left = get(2 * start + 1, tl, mid, l, min(mid, r));
    node right = get(2 * start + 2, mid, tr, max(mid, l), r);
    return help(left, right);
}

ll get2(ll start, ll tl, ll tr, ll l, ll r) {
    if (l >= r) return INF;
    if (tl == l && tr == r) return t2[start];

    ll mid = (tl + tr) / 2;
    auto left = get2(2 * start + 1, tl, mid, l, min(mid, r));
    auto right = get2(2 * start + 2, mid, tr, max(mid, l), r);
    return min(left, right);
}
bool check(ll len) {
    bool ok = 0;
    rep(l, n) {
        ll r = l + len;
        if (r >= n + 1) break;
        ll g = get(0, 0, n, l, r).gcdd;
        if (g == get2(0, 0, n, l, r)) ok = 1;
        if (ok) return 1;
    }

    return ok;
}

void gett(ll len) {
    rep(l, n) {
        bool ok = 0;
        ll r = l + len;
        if (r >= n + 1) break;
        ll g = get(0, 0, n, l, r).gcdd;
        if (g == get2(0, 0, n, l, r)) ok = 1;
        if (ok) anss.push_back(l);
    }

    return;
}

void solve() {
    cin >> n;
    vset(v, n, 0);
    t.clear();
    t2.clear();
    anss.clear();
    t.resize(4 * n, node(1));
    t2.resize(4 * n, INF);

    rep(i, n) cin >> v[i];

    build(0, 0, n);
    build2(0, 0, n);
    ll lo = 1;
    ll hi = n;
    ll ans = 1;

    while (lo <= hi) {
        ll mid = (lo + hi) / 2;
        if (check(mid)) {
            lo = mid + 1;
            ans = max(ans, mid);
        } else {
            hi = mid - 1;
        }
    }

    gett(ans);
    sort(all(anss));
    cout << anss.size() << " " << ans - 1 << '\n';
    rep(i, anss.size()) {
        cout << anss[i] + 1 << ' ';
    }
    cout << '\n';

    return;
}

int main(int argc , char ** argv) {
    ios_base::sync_with_stdio(false) ;
    cin.tie(NULL) ;

    ll t = 1;
    while (t--) {
        solve();
    }

    return 0 ;
}