#include <bits/stdc++.h>
long long mod(long long x) {
  if (x < 0) return -x;
  return x;
}
using namespace std;
vector<int> v;
int a[1000000], b[1000000];
int main() {
  ios_base::sync_with_stdio(false);
  long long n, t, x = 0, y = 0;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> t;
    a[i] = b[i] = t;
  }
  sort(a, a + n);
  if (a[0] == a[1]) {
    cout << "Still Rozdil" << endl;
  } else {
    for (int i = 0; i < n; ++i) {
      if (b[i] == a[0]) {
        cout << i + 1 << endl;
        return 0;
      }
    }
  }
  return 0;
}
