#include <bits/stdc++.h>
using namespace std;
const signed long long int INF = 1e9;
int main() {
  int n;
  cin >> n;
  vector<signed long long int> a(n);
  for (int i(0); i < n; i++) {
    scanf("%lld", &a[i]);
  }
  int s, f;
  scanf("%d %d", &s, &f);
  vector<signed long long int> d(n + 1);
  d[0] = a[0];
  for (int i(1); i < n; i++) {
    d[i] = d[i - 1] + a[i];
  }
  signed long long int ans = 0;
  signed long long int tp = INF;
  for (int i(0); i < n; i++) {
    int l = (i + s - 1 + n) % n;
    int r = (i + f - 2 + n) % n;
    signed long long int tmp = 0;
    if (l <= r) {
      tmp += d[r];
      if (l - 1 >= 0) tmp -= d[l - 1];
    } else {
      tmp += d[r];
      tmp += d[n - 1];
      if (l - 1 >= 0) tmp -= d[l - 1];
    }
    if (ans <= tmp) {
      signed long long int ti;
      if (i == 0)
        ti = 1;
      else
        ti = n - 1 - i + 2;
      if (ans == tmp) {
        tp = min(tp, ti);
      } else {
        ans = tmp;
        tp = ti;
      }
    }
  }
  cout << tp;
  return 0;
}
