#include <bits/stdc++.h>
using namespace std;
long long a[210000], res[100010], presum[210000], n, s, f;
void read() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  cin >> s >> f;
  for (int i = n + 1; i <= 2 * n; i++) a[i] = a[i - n];
  for (int i = 1; i <= 2 * n; i++) presum[i] = presum[i - 1] + a[i];
}
void solve() {
  s += n;
  f += n;
  f--;
  for (int i = 1; i <= n; i++) {
    res[i] = presum[f] - presum[s - 1];
    s--;
    f--;
  }
  long long maxval = 0, maxindex = 0;
  for (int i = 1; i <= n; i++) {
    if (res[i] > maxval) {
      maxval = res[i];
      maxindex = i;
    }
  }
  cout << maxindex;
}
int main() {
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  read();
  solve();
  return 0;
}
