#include <bits/stdc++.h>
const long long INF = 2e18;
const long long N = 1e6 + 1;
const long long mod = 1e9 + 7;
const long double eps = 1E-7;
using namespace std;
int ct[N], bt[N];
void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> ct[i];
    bt[i] = ct[i];
  }
  sort(bt, bt + n);
  if (bt[0] == bt[1]) {
    cout << "Still Rozdil\n";
    return;
  }
  for (int i = 0; i < n; ++i)
    if (ct[i] == bt[0]) {
      cout << i + 1 << endl;
      return;
    }
}
bool mtest = false;
int main() {
  ios_base::sync_with_stdio(0);
  int TE = 1;
  if (mtest) cin >> TE;
  while (TE--) solve();
  return 0;
}
