#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};
int n;
vector<unsigned long long int> vec, vec2;
unsigned long long int minn = 10000000000, pos = 0;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    unsigned long long int a;
    cin >> a;
    if (a < minn) minn = a, pos = i;
    vec.push_back(a);
    vec2.push_back(a);
  }
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  sort(vec.begin(), vec.end());
  if (vec[0] == vec[1]) {
    cout << "Still Rozdil" << endl;
    return 0;
  }
  cout << pos + 1 << endl;
  return 0;
}
