#include <bits/stdc++.h>
using namespace std;
int firstt(int* a, int n) {
  long long l, r, s;
  for (int i = 0; i <= n - 1; ++i) {
    l = 0;
    r = 10000000000;
    while (l < r - 1) {
      s = (-l + r) / 2 + l;
      if (s * n >= a[i] - i) {
        r = s;
      } else {
        l = s;
      }
    }
    if (l * n >= a[i] - i) {
      a[i] = l;
    } else {
      a[i] = l + 1;
    }
  }
  l = 0;
  int minn = a[0];
  for (int i = 1; i <= n - 1; ++i) {
    if (a[i] < minn) {
      minn = a[i];
      l = i;
    }
  }
  return (l + 1);
}
int main() {
  int n, i;
  cin >> n;
  int* a = new int[n];
  for (i = 0; i <= n - 1; ++i) {
    cin >> a[i];
  }
  long long res = firstt(a, n);
  cout << res;
}
