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

using ll = long long;
using i128 = __int128_t;
constexpr ll P = 1e18 + 9;

ll qpow(ll a, ll b) {
    ll res = 1;
    while(b) {
        if(b & 1) res = (i128)res * a % P;
        a = (i128)a * a % P, b >>= 1;
    }
    return res;
}
void solve() {
    int n;
    cin >> n;
    vector<ll> a(n + 1);
    ll prod = 1;
    for(int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        for(auto ch : s) {
            a[i] = ((i128)10 * a[i] + ch - '0') % P;
        }
        prod = (i128)prod * a[i] % P;
    }
    for(int i = 1; i <= n; i++) {
        if(qpow(a[i], n) == prod) {
            cout << i << '\n';
            return;
        }
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}