#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include <algorithm>
using namespace std;
#define maxn 100005
int n,x,num[maxn];
map<int,int> p;
int main()
{

	scanf("%d%d",&n,&x);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&num[i]);
		p[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(p[num[i]]>1)
		{
			printf("0\n");
			return 0;
		}
	}

	for(int i=1;i<=n;i++)
	{
		int t=x&num[i];
		if(p[t]==2)
		{
			printf("1\n");
			return 0;
		}
	}
	map<int,int> mp;
	for(int i=1;i<=n;++i)
	{
		num[i]=x&num[i];
		mp[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(mp[num[i]]!=1)
		{
			printf("2\n");
			return 0;
		}
	}
	printf("-1\n");

	return 0;

}


#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include <algorithm>
using namespace std;
#define maxn 100005
int n,x,num[maxn];
map<int,int> p;
int main()
{

	scanf("%d%d",&n,&x);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&num[i]);
		p[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(p[num[i]]>1)
		{
			printf("0\n");
			return 0;
		}
	}

	for(int i=1;i<=n;i++)
	{
		int t=x&num[i];
		if(p[t])
		{
			printf("1\n");
			return 0;
		}
	}
	map<int,int> mp;
	for(int i=1;i<=n;++i)
	{
		num[i]=x&num[i];
		mp[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(mp[num[i]]!=1)
		{
			printf("2\n");
			return 0;
		}
	}
	printf("-1\n");

	return 0;

}


#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include <algorithm>
using namespace std;
#define maxn 100005
int n,x,num[maxn];
map<int,int> p;
int main()
{

	scanf("%d%d",&n,&x);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&num[i]);
		if(!p.count(num[i]))
		p[num[i]]++;
		else
		{
			printf("0\n");
			return 0;
		}
	}
	for(int i=1;i<=n;i++)
	{
		int t=x&num[i];
		if(p[t])
		{
			printf("1\n");
			return 0;
		}
	}
	map<int,int> mp;
	for(int i=1;i<=n;++i)
	{
		num[i]=x&num[i];
		mp[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(mp[num[i]]>=2)
		{
			printf("2\n");
			return 0;
		}
	}
	printf("-1\n");

	return 0;

}


#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include <algorithm>
using namespace std;
#define maxn 100005
int n,x,num[maxn];
map<int,int> p;
int main()
{

	scanf("%d%d",&n,&x);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&num[i]);
		p[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(p[num[i]]>1)
		{
			printf("0\n");
			return 0;
		}
	}

	for(int i=1;i<=n;i++)
	{
		int t=x&num[i];

		if(p[t]==1&&t!=num[i])
		{
			printf("1\n");
			return 0;
		}
	}
	map<int,int> mp;
	for(int i=1;i<=n;++i)
	{
		num[i]=x&num[i];
		mp[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(mp[num[i]]!=1)
		{
			printf("2\n");
			return 0;
		}
	}
	printf("-1\n");

	return 0;

}


#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include <algorithm>
using namespace std;
#define maxn 100005
int n,x,num[maxn];
map<int,int> p;
int main()
{

	scanf("%d%d",&n,&x);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&num[i]);
		if(!p.count(num[i]))
		p[num[i]]++;
		else
		{
			printf("0\n");
			return 0;
		}
	}
	if((x+1)&x==0&&!p.count(x))
	{
		printf("-1\n");
		return 0;
	}

	for(int i=1;i<=n;i++)
	{
		int t=x&num[i];
		if(p.count(t))
		{
			printf("1\n");
			return 0;
		}
	}
	map<int,int> mp;
	for(int i=1;i<=n;++i)
	{
		num[i]=x&num[i];
		mp[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(mp.count(num[i]))
		{
			printf("2\n");
			return 0;
		}
	}
	printf("-1\n");

	return 0;

}


#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include <algorithm>
using namespace std;
#define maxn 100005
int n,x,num[maxn];
map<int,int> p;
int main()
{

	scanf("%d%d",&n,&x);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&num[i]);
		if(p.count(num[i]))
		p[num[i]]++;
		else
		{
			printf("0\n");
			return 0;
		}
	}
	if((x+1)&x==0&&!p.count(x))
	{
		printf("0\n");
		return 0;
	}

	for(int i=1;i<=n;i++)
	{
		int t=x&num[i];
		if(p.count(t))
		{
			printf("%d\n",1);
			return 0;
		}
	}
	map<int,int> mp;
	for(int i=1;i<=n;++i)
	{
		num[i]=x&num[i];
		mp[num[i]]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(mp.count(num[i]))
		{
			printf("%d\n",2);
			return 0;
		}
	}

	return 0;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
     ll n,x;
     cin>>n>>x;
     ll a[n];
     ll flag=0;
     forin
     {
         cin>>a[i];
         if(a[i]==x)flag=1;
     }
     set<int>x1;

     forin
     x1.insert(a[i]);
     if(x1.size()!=n){
        cout<<0<<endl;
        return 0;}

         forin
         a[i]=a[i] & x;
         set<int>y;
         forin y.insert(a[i]);
         if(y.size()==n)
            cout<<-1<<endl;
         else if(flag)
         {
             cout<<1<<endl;
         }else
         cout<<2<<endl;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
     ll n,x;
     cin>>n>>x;
     ll a[n];
     ll flag=0;
     ll flag1=0;
     forin
     {
         cin>>a[i];
         if(a[i]==x)flag=1;
     }
     set<int>x1;

     forin
     x1.insert(a[i]);
     if(x1.size()!=n){
        cout<<0<<endl;
        return 0;}
        set<int>y;

        forin
        {
            ll z=a[i] & x;
            y.insert(z);
        }

        forin
        {     if(a[i]!=x){
            ll z=a[i] & x;
            if(x1.count(z))
            {
                cout<<1<<endl;
                return 0;
            }}
        }
        set<int>y;
        ll cnt=0;
        forin
        {
            a[i]=a[i] & x;
            if(a[i]==x)cnt++;
            y.insert(a[i]);
        }
        if(flag && cnt>1)
        {
            cout<<1<<endl;
            return 0;
        }
        if(y.size()==n)cout<<-1<<endl;
        else
            cout<<2<<endl;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
     ll n,x;
     cin>>n>>x;
     ll a[n];
     ll flag=0;
     ll flag1=0;
     forin
     {
         cin>>a[i];
         if(a[i]==x)flag=1;
     }
     set<int>x1;

     forin
     x1.insert(a[i]);
     if(x1.size()!=n){
        cout<<0<<endl;
        return 0;}
        set<int>y;

        forin
        {
            ll z=a[i] & x;
            y.insert(z);
        }

        forin
        {
            if(a[i]!=x)
            {
                a[i]=a[i] & x;
                if(a[i]==x && flag)
                {
                    cout<<1<<endl;
                    return 0;
                }
            }
        }
        if(y.size()==n)
            cout<<-1<<endl;
        else
            cout<<2<<endl;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
     ll n,x;
     cin>>n>>x;
     ll a[n];
     ll flag=0;
     ll flag1=0;
     forin
     {
         cin>>a[i];
         if(a[i]==x)flag=1;
     }
     set<int>x1;

     forin
     x1.insert(a[i]);
     if(x1.size()!=n){
        cout<<0<<endl;
        return 0;}
        set<int>y;

        forin
        {
            ll z=a[i] & x;
            y.insert(z);
        }

        forin
        {     if(a[i]!=x){
            ll z=a[i] & x;
            if(x1.count(z))
            {
                cout<<1<<endl;
                return 0;
            }}
        }
       // set<int>y;
        ll cnt=0;
        forin
        {
            a[i]=a[i] & x;
            if(a[i]==x)cnt++;
            y.insert(a[i]);
        }
        if(flag && cnt>1)
        {
            cout<<1<<endl;
            return 0;
        }
        if(y.size()==n)cout<<-1<<endl;
        else
            cout<<2<<endl;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
     ll n,x;
     cin>>n>>x;
     ll a[n];
     forin cin>>a[i];
     set<int>x1;

     forin
     x1.insert(a[i]);
     if(x1.size()!=n){
        cout<<0<<endl;
        return 0;}

         forin
         a[i]=a[i] & x;
         set<int>y;
         forin
         y.insert(a[i]);
         if(y.size()!=n)
            cout<<1<<endl;
         else
            cout<<-1<<endl;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5+10;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
    ll n,x;
    cin>>n>>x;
    ll a[n];
    ll b[n];
    ll cnt1[N];
    memset(cnt1,0,sizeof(cnt1));
    ll cnt2[N];
        memset(cnt2,0,sizeof(cnt2));

    forin
    {
        cin>>a[i];
        cnt1[a[i]]++;
        b[i]=a[i] & x;
        cnt2[b[i]]++;
        if(cnt1[a[i]]>1)
        {
            cout<<0<<endl;
            return 0;
        }
    }
    forin

    {
        if(a[i]!=b[i] && cnt2[a[i]]>0)
        {
            cout<<1<<endl;
            return 0;
        }
    }forin
    {
        if(cnt2[b[i]]>1){
            cout<<2<<endl;
        return 0;}
    }
    cout<<-1<<endl;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
     ll n,x;
     cin>>n>>x;
     ll a[n];
     ll flag=0;
     forin
     {
         cin>>a[i];
         if(a[i]==x)flag=1;
     }
     set<int>x1;

     forin
     x1.insert(a[i]);
     if(x1.size()!=n){
        cout<<0<<endl;
        return 0;}

         forin
         a[i]=a[i] & x;
         ll cnt=0;
         forin
         {
             if(a[i]==x)
                cnt++;
         }
         if(cnt>1 && flag)
            cout<<1<<endl;
         else if(cnt>1 && flag==0)
            cout<<2<<endl;
         else
         {
             set<int>y;
             forin y.insert(a[i]);
             if(y.size()!=n)
                cout<<2<<endl;
             else
                cout<<-1<<endl;
         }

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
     ll n,x;
     cin>>n>>x;
     ll a[n];
     ll flag=0;
     ll flag1=0;
     forin
     {
         cin>>a[i];
         if(a[i]==x)flag=1;
     }
     set<int>x1;

     forin
     x1.insert(a[i]);
     if(x1.size()!=n){
        cout<<0<<endl;
        return 0;}
        set<int>y;

        forin
        {
            ll z=a[i] & x;
            y.insert(z);
        }

        forin
        {     if(a[i]!=x){
            ll z=a[i] & x;
            if(x.count(z))
            {
                cout<<1<<endl;
                return 0;
            }}
        }
        set<int>y;
        ll cnt=0;
        forin
        {
            a[i]=a[i] & x;
            if(a[i]==x)cnt++;
            y.insert(a[i]);
        }
        if(flag && cnt>1)
        {
            cout<<1<<endl;
            return 0;
        }
        if(y.size()==n)cout<<-1<<endl;
        else
            cout<<2<<endl;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5+10;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
    ll n,x;
    cin>>n>>x;
    ll a[n];
    ll b[n];
    ll cnt1[N];
    memset(cnt1,0,sizeof(cnt1));
    ll cnt2[N];
        memset(cnt2,0,sizeof(cnt2));

    forin
    {
        cin>>a[i];
        cnt1[a[i]]++;
        b[i]=a[i] & x;
        cnt2[b[i]]++;
        if(cnt1[a[i]]>1)
        {
            cout<<0<<endl;
            return 0;
        }
    }
    forin

    {
        if(a[i]!=b[i] && cnt2[a[i]]>0 || (cnt2[a[i]]>1))
        {
            cout<<1<<endl;
            return 0;
        }
    }forin
    {
        if(cnt2[b[i]]>1){
            cout<<2<<endl;
        return 0;}
    }
    cout<<-1<<endl;

}


   //NAME-ADITYYA OJHA
/*
 * 	Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid to fall...
                                             (courtesy-amnesiac_dusk)
 */
#include <bits/stdc++.h>
#define ll long long int
#define forin for(int i=0;i<n;i++)
#define forjn for(int j=0;j<n;j++)
#define pb push_back
#define vx vector<ll> x
#define vy  vector<ll> y
#define fas1  ios_base::sync_with_stdio(false)
#define fas2   cin.tie(NULL)
#define fas3   cout.tie(NULL)
#define  f   first
#define  s   second
#define mod 1000007
 const ll N=1e5;
using namespace std;
int main ()
{
    fas1,fas2,fas3;
     ll n,x;
     cin>>n>>x;
     ll a[n];
     ll flag=0;
     forin
     {
         cin>>a[i];
         if(a[i]==x)flag=1;
     }
     set<int>x1;

     forin
     x1.insert(a[i]);
     if(x1.size()!=n){
        cout<<0<<endl;
        return 0;}

         forin
         a[i]=a[i] & x;
         set<int>y;
         forin
         y.insert(a[i]);
         if(y.size()!=n  && flag)
            cout<<1<<endl;
            else if(y.size()!=n && flag==0)
                cout<<2<<endl;
         else
            cout<<-1<<endl;

}


#include<bits/stdc++.h>
using namespace std;

int main()
{

long long n,x;
cin>>n>>x;
long long a[n]={0};

for(long long i=0;i<n;i++)
{	long long z;
	cin>>z;
	for(long long j=0;j<i;j++)
	{
		if(z==a[j])
		{
			cout<<0;
			return 0;
		}
	}
	a[i]=z;

}
bool flag=false;
	for(long long i=0;i<n;i++)
	{

		long long b=a[i]&x;

		for(long long j=0;j<n;j++)
		{
			if(b==a[j]&&i!=j)
			{
			cout<<1;
			flag=true;
		return 0;
			}
		}

	}
	if(!flag)
	{
		cout<<-1;
		return 0;
	}
	cout<<2;

}


#include<bits/stdc++.h>
using namespace std;

int main()
{

long long n,x;
cin>>n>>x;
set<long long >s;
long long a[100000]={0},value=-1;

for(long long i=0;i<n;i++)
{	long long b;
	cin>>b;
	s.insert(b);
	if(s.size()<i+1)
	{
		cout<<0;
		return 0;
	}
	a[b]+=1;
	if((b&x)!=b)a[(b&x)]++;

	value=max(a[b&x],value);

	if(a[b&x]==2&&s.find(b&x)==s.end())
	{
		cout<<2;
		return 0;
	}
	if(value==3)
	break;
}

if(value>1)
cout<<value-1;
else
cout<<-1;

}


#include<bits/stdc++.h>
using namespace std;

int main()
{

			int n,x,y;
			cin>>n>>x;
			set<int >s;
			int a[100001]={0},b[100001]={0},value=0,ans=-1;
			bool flag=true;
			for(int i=0;i<n;i++)
			{
				cin>>y;

				if(a[y])ans=0;

				if(ans)
				{
					if(a[y&x]||b[y])
					{
						ans=1;
					}
					}

					if(ans!=1&&ans)
					{
						if(b[y&x])
						{
							ans=2;
						}
					}

					a[y]=1;
					b[y&x]=1;
					}

				cout<<ans;

			}


#include<bits/stdc++.h>
using namespace std;

int main()
{

			int n,x,y;
			cin>>n>>x;
			set<int >s;
			int a[100001]={0},value=0,ans=-1;

			for(int i=0;i<n;i++)
			{
				cin>>y;
				if(!(a[y]>0)&&x!=y)
					a[y]++;
				s.insert(y);
				if(s.size()<i+1)
				{
					ans=0;
					break;
				}

				if((y&x)!=y&&(y&x)!=0)
			{
					a[y&x]++;

				ans=max(ans,a[y&x]);

			}
				if(ans==2)
				{
					break;
					}

			}
		cout<<ans;

}


#include<bits/stdc++.h>
using namespace std;

int main()
{

long long n,x;
cin>>n>>x;
long long a[n]={0};

for(long long i=0;i<n;i++)
{	long long z;
	cin>>z;
	for(long long j=0;j<i;j++)
	{
		if(z==a[j])
		{
			cout<<0;
			return 0;
		}
	}
	a[i]=z;

}
bool flag=false;
	for(long long i=0;i<n;i++)
	{

		long long b=a[i]&x;

		for(long long j=0;j<n;j++)
		{
			if(b==a[j]&&i!=j)
			{
			cout<<1;

		return 0;
			}

			if((b==(a[j]&x)) &&i!=j)
			{
				cout<<2;
				return 0;
			}
		}

	}

	cout<<-1;

}


#include<bits/stdc++.h>
using namespace std;

int main()
{

			int n,x,y;
			cin>>n>>x;
			set<int >s;
			int a[100001]={0},value=0,ans=-1;
			bool flag=true;
			for(int i=0;i<n;i++)
			{
				cin>>y;
				if(!(a[y]>0))
					a[y]++;
					else
					{
						a[y]=1;
						ans=1;
						flag=false;
					}
				s.insert(y);
				if(s.size()<i+1)
				{
					ans=0;
					break;
				}

				if((y&x)!=y&&(y&x)!=0&&flag)
			{
					a[y&x]++;

				ans=max(ans,a[y&x]);

			}

			}
			if(ans>2)
			{
				ans=2;
			}
		cout<<ans;

}


#include<bits/stdc++.h>
using namespace std;

int main()
{

			int n,x,y;
			cin>>n>>x;
			set<int >s;
			int a[100001]={0},b[100001],value=0,ans=-1;
			bool flag=true;
			for(int i=0;i<n;i++)
			{
				cin>>y;

				if(a[y])ans=0;

				if(ans)
				{
					if(a[y&x]||b[y])
					{
						ans=1;
					}
					}

					if(ans!=1&&ans)
					{
						if(b[y&x])
						{
							ans=2;
						}
					}

					a[y]=1;
					b[y&x]=1;
					}

				cout<<ans;

			}


#include<bits/stdc++.h>
using namespace std;

int main()
{

			int n,x,y;
			cin>>n>>x;
			set<int >s;
			int a[100001]={0},value=0,ans=-1;
			bool flag=true;
			for(int i=0;i<n;i++)
			{
				cin>>y;
				if(!(a[y]>0)&&x!=y)
					a[y]++;
					else
					{
						a[y]=1;
						ans=1;
						flag=false;
					}
				s.insert(y);
				if(s.size()<i+1)
				{
					ans=0;
					break;
				}

				if((y&x)!=y&&(y&x)!=0&&flag)
			{
					a[y&x]++;

				ans=max(ans,a[y&x]);

			}

			}
			if(ans>2)
			{
				ans=2;
			}
		cout<<ans;

}


#include<bits/stdc++.h>
using namespace std;

int main()
{

			int n,x,y;
			cin>>n>>x;
			set<int >s;
			int a[100001]={0},value=0,ans=-1;

			for(int i=0;i<n;i++)
			{
				cin>>y;
				if(!(a[y]>0)&&x!=y)
					a[y]++;
				s.insert(y);
				if(s.size()<i+1)
				{
					ans=0;
					break;
				}

				if((y&x)!=y&&(y&x)!=0)
			{
					a[y&x]++;

				ans=max(ans,a[y&x]);

			}

			}
			if(ans>2)
			{
				ans=2;
			}
		cout<<ans;

}


#include<bits/stdc++.h>
using namespace std;

int main()
{

long long n,x;
cin>>n>>x;
long long a[n]={0};

for(long long i=0;i<n;i++)
{	long long z;
	cin>>z;
	for(long long j=0;j<i;j++)
	{
		if(z==a[j])
		{
			cout<<0;
			return 0;
		}
	}
	a[i]=z;

}
bool flag=false;
	for(long long i=0;i<n;i++)
	{

		long long b=a[i]&x;

		for(long long j=0;j<n;j++)
		{
			if(b==a[j]&&i!=j)
			{
			cout<<1;

		return 0;
			}

			if((b==(a[j]&x)) &&i!=j &&x!=a[i])
			{
				cout<<2;
				return 0;
			}
		}

	}

	cout<<-1;

}


#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+7;
inline int read(){
	int x=0,f=1;char C=getchar();
	while(!isdigit(C)) {if(C=='-') f=-1;C=getchar();}
	while(isdigit(C)) x=(x<<1)+(x<<3)+C-'0',C=getchar();
	return x*f;
}
int n,x,a[maxn],num[maxn],b[maxn],ans=1<<30;
int main(){
	n=read(),x=read();
	for(int i=1,x;i<=n;i++){
		x=a[i]=read(),num[a[i]]++;
		if(num[a[i]]>=2) ans=min(ans,0);
		a[i]&=x; if(a[i]!=x) b[a[i]]++;
		if(b[a[i]]+num[a[i]]>=2) ans=min(ans,1);
		if(b[a[i]]>=2) ans=min(ans,2);
	}
	printf("%d\n",(ans>=1000000000)?-1:ans);
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+7;
inline int read(){
	int x=0,f=1;char C=getchar();
	while(!isdigit(C)) {if(C=='-') f=-1;C=getchar();}
	while(isdigit(C)) x=(x<<1)+(x<<3)+C-'0',C=getchar();
	return x*f;
}
int n,x,a[maxn],num[maxn],b[maxn],ans=3;
int main(){
	n=read(),x=read();
	for(int i=1;i<=n;i++){
		a[i]=read(); num[a[i]]++;
		if(num[a[i]]>=2) ans=min(ans,0);
	}
	for(int i=1,y;i<=n;i++){
		y=a[i],a[i]&=x; if(y!=a[i]) b[a[i]]++;
		if(b[a[i]]>=2) ans=min(ans,2);
		if(b[a[i]]<2&&num[a[i]]<2&&b[a[i]]+num[a[i]]>=2) ans=min(ans,1);
		// cout<<a[i]<<" "<<b[a[i]]<<" "<<num[a[i]]<<endl;
	}
	printf("%d\n",(ans==3)?-1:ans);
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+7;
inline int read(){
	int x=0,f=1;char C=getchar();
	while(!isdigit(C)) {if(C=='-') f=-1;C=getchar();}
	while(isdigit(C)) x=(x<<1)+(x<<3)+C-'0',C=getchar();
	return x*f;
}
int n,x,a[maxn],num[maxn],b[maxn],ans=1<<30;
int main(){
	n=read(),x=read();
	for(int i=1,y;i<=n;i++){
		y=a[i]=read(),num[a[i]]++;
		a[i]&=x; if(a[i]!=y) b[a[i]]++;
	}
	for(int i=0;i<=150000;i++){
		if(num[i]>=2) ans=min(ans,0);
		if(b[i]>=2) ans=min(ans,2);
		if(num[i]+b[i]>=2&&b[i]<2) ans=min(ans,1);
	}
	printf("%d\n",(ans>=1000000000)?-1:ans);
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+7;
inline int read(){
	int x=0,f=1;char C=getchar();
	while(!isdigit(C)) {if(C=='-') f=-1;C=getchar();}
	while(isdigit(C)) x=(x<<1)+(x<<3)+C-'0',C=getchar();
	return x*f;
}
int n,x,a[maxn],num[maxn],b[maxn],ans=1<<30;
int main(){
	n=read(),x=read();
	for(int i=1,y;i<=n;i++){
		y=a[i]=read(),num[a[i]]++;
		if(num[a[i]]>=2) ans=min(ans,0);
		a[i]&=x; if(a[i]!=y) b[a[i]]++;
		if(b[a[i]]>=2) ans=min(ans,2);
	}
	for(int i=0;i<=100000;i++){
		if(num[i]>=2) ans=min(ans,0);
		if(b[i]>=2) ans=min(ans,2);
		if(num[i]+b[i]>=2) ans=min(ans,1);
	}
	printf("%d\n",(ans>=1000000000)?-1:ans);
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+7;
inline int read(){
	int x=0,f=1;char C=getchar();
	while(!isdigit(C)) {if(C=='-') f=-1;C=getchar();}
	while(isdigit(C)) x=(x<<1)+(x<<3)+C-'0',C=getchar();
	return x*f;
}
int n,x,a[maxn],num[maxn],b[maxn],ans=1<<30;
int main(){
	n=read(),x=read();
	for(int i=1,y;i<=n;i++){
		y=a[i]=read(),num[a[i]]++;
		if(num[a[i]]>=2) ans=min(ans,0);
		a[i]&=x; if(a[i]!=y) b[a[i]]++;
		if(b[a[i]]+num[a[i]]>=2) ans=min(ans,1);
		if(b[a[i]]>=2) ans=min(ans,2);
	}
	printf("%d\n",(ans>=1000000000)?-1:ans);
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
 typedef long long int ll;
 int main()
 {
 	ll n;
 	cin>>n;
 	int a[n];
 	pair<ll,ll>p[n];
	 for(ll i=0;i<n;i++)
 	{
 		cin>>a[i];
 		p[i].first=a[i];
 		p[i].second=i+1;

 	}
 	sort(p,p+n);
 	if(p[0]==p[1])
 		cout<<"Still Rozdil";
 		else
 		cout<<p[0].second;
 	return 0;
 }


#include<bits/stdc++.h>
using namespace std;
 typedef long long int ll;
 int main()
 {
 	ll n;
 	cin>>n;
 	int a[n];
 	pair<ll,ll>p[n];
	 for(ll i=0;i<n;i++)
 	{
 		cin>>a[i];
 		p[i].first=a[i];
 		p[i].second=i+1;

 	}
 	sort(p,p+n);
 	if(a[0]==a[1])
 		cout<<"Still Rozdil";
 		else
 		cout<<p[0].second;
 	return 0;
 }


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index;
    for (int i = 0; i < n; i++) {
        index = i;
        for (int j = i; j < n; j++) {
            if (t[j] < t[index]){
                int temp = t[j];
                t[j] = t[index];
                t[index] = temp;
                index = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index1, index2 = 0;
    if(n == 1){
        cout << 1;
        return 0;
    }
    for (int i = 0; i < 2; i++) {
        index1 = i;
        for (int j = i; j < n; j++) {
            if (t[j] < t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index1 = j;
                if(i == 0)
                    index2 = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index2 + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index1, index2;
    if(n == 1){
        cout << 1;
        return 0;
    }
    for (int i = 0; i < 2; i++) {
        index2 = i;

        for (int j = i; j < n; j++) {
            if (t[j] < t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index1 = index2;
                index2 = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index2 + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index;
    for (int i = 0; i < n; i++) {
        index = i;
        for (int j = i; j < n; j++) {
            if (t[j] <= t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index;
    for (int i = 0; i < 3; i++) {
        index = i;
        for (int j = i; j < n; j++) {
            if (t[j] <= t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index;
    if(n == 1){
        cout << 1;
        return 0;
    }
    for (int i = 0; i < 2; i++) {
        index1 = i;
        index2 = i;
        for (int j = i; j < n; j++) {
            if (t[j] < t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index1 = index2;
                index2 = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index2 + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index;
    if(n == 1){
        cout << 1;
        return 0;
    }
    for (int i = 0; i < 2; i++) {
        index = i;
        for (int j = i; j < n; j++) {
            if (t[j] <= t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index1, index2;
    if(n == 1){
        cout << 1;
        return 0;
    }
    for (int i = 0; i < 2; i++) {
        index1 = i;
        index2 = i;
        for (int j = i; j < n; j++) {
            if (t[j] < t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index1 = index2;
                index2 = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index2 + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index;
    for (int i = 0; i < 2; i++) {
        index = i;
        for (int j = i; j < n; j++) {
            if (t[j] <= t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index + 1;

    return 0;
}


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    int index1, index2;
    if(n == 1){
        cout << 1;
        return 0;
    }
    for (int i = 0; i < 2; i++) {
        index1 = i;
        for (int j = i; j < n; j++) {
            if (t[j] < t[i]){
                int temp = t[j];
                t[j] = t[i];
                t[i] = temp;
                index1 = j;
                if(i == 0)
                    index2 = j;
            }
        }
    }

    if (t[0] == t[1])
        cout << "Still Rozdil";
    else
        cout << index2 + 1;

    return 0;
}


#include<stdio.h>
int main()
{
    long long int i,j,k,l,m,n,o,p,sum,tot,num;
    long long int temp,lock,index;
        scanf("%lld",&n);
          index=1000000000;m=0;lock=0;
        for(o=0; o<n; o++)
        {
            scanf("%lld",&k);
            if(k<index)
            {
                index=k;
                m=o;
                lock=1;
            }
            else if(k==index)
            {
                lock=2;
            }
        }
            if(lock==1)
            {
                printf("%lld\n",m+1);
            }
            else if(lock==2)
            {
                printf("Still Rozdil\n");
            }

    return 0;
}


#include<stdio.h>
int main()
{
    long long int i,j,k,l,m,n,o,p,sum,tot,num;
    long long int temp,lock,index;
        scanf("%lld",&n);
          index=1000000000000;m=0;lock=0;
        for(o=0; o<n; o++)
        {
            scanf("%lld",&k);
            if(k<index)
            {
                index=k;
                m=o;
                lock=1;
            }
            else if(k==index)
            {
                lock=2;
            }
        }
            if(lock==1)
            {
                printf("%lld\n",m+1);
            }
            else if(lock==2)
            {
                printf("Still Rozdil\n");
            }

    return 0;
}


#include<stdio.h>
int main()
{
    long long int i,j,k,l,m,n,o,p,sum,count,tot,num;
    long long int str[1000000000],temp,lock,index;
        scanf("%lld",&n);
          index=10000;m=0;
        for(o=0; o<n; o++)
        {
            scanf("%lld",&str[o]);
        }
        for(p=0; p<n; p++)
        {
            if(str[p]<index)
            {
                index=str[p];
                m=p;
                lock=2;
            }
        }
        for(i=0;i<n;i++)
        {
            if(str[i]==index && i!=m)
            {
                lock=1;
                break;
            }
        }
            if(lock==2)
            {
                printf("%lld\n",m+1);
            }
            else if(lock==1)
            {
                printf("Still Rozdil\n");
            }

    return 0;
}


#include<stdio.h>
int main()
{
    long long int i,j,k,l,m,n,o,p,sum,count,tot,num;
    long long int str[100000],temp,lock,index;
        scanf("%lld",&n);
          index=10000;m=0;
        for(o=0; o<n; o++)
        {
            scanf("%lld",&str[o]);
        }
        for(p=0; p<n; p++)
        {
            if(str[p]<index)
            {
                index=str[p];
                m=p;
                lock=2;
            }
        }
        for(i=0;i<n;i++)
        {
            if(str[i]==index && i!=m)
            {
                lock=1;
                break;
            }
        }
            if(lock==2)
            {
                printf("%lld\n",m+1);
            }
            else if(lock==1)
            {
                printf("Still Rozdil\n");
            }

    return 0;
}


#include<stdio.h>
int main()
{
    long long int i,j,k,l,m,n,o,p,sum,tot,num;
    long long int str[10000],temp,lock,index;
        scanf("%lld",&n);
          index=1000000000;m=0;
        for(o=0; o<n; o++)
        {
            scanf("%lld",&str[o]);
        }
        for(p=0; p<n; p++)
        {
            if(str[p]<index)
            {
                index=str[p];
                m=p;
                lock=2;
            }
        }
        for(i=0;i<n;i++)
        {
            if(str[i]==index && i!=m)
            {
                lock=1;
                break;
            }
        }
            if(lock==2)
            {
                printf("%lld\n",m+1);
            }
            else if(lock==1)
            {
                printf("Still Rozdil\n");
            }

    return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin>>n;
    long int min = 10000000;
    int ver = 0;
    int val = 0;
    stack<int>s;
    s.push(0);
    for(int i = 0;i<n;i++){
        cin>>val;
        if(val<min){
            min  = val;
            s.pop();
            s.push(i+1);
        }
        if(val==min){
            min = val;
            ver = 1;
            cout<<"Still Rozdil"<<endl;
            break;
        }
    }
    if(ver == 0){
        cout<<s.top()<<endl;
    }
}


#include <bits/stdc++.h>

using namespace std;

int main(){
    long int n;
    cin>>n;
    long long min = 10000000000000;
    long long  ver = 0;
    long long  val = 0;
    stack<int>s;
    s.push(0);
    for(int i = 0;i<n;i++){
        cin>>val;
        if(val<min){
            min  = val;
            s.pop();
            s.push(i+1);
        }
        else if(val==min){
            min = val;
            ver = 1;
        }
    }
    if(ver == 0){
        cout<<s.top()<<endl;
    }
    else if(ver ==1){
        cout<<"Still Rozdil"<<endl;
    }
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main(){
    long int n;
    cin>>n;
    long long min = 10000000000000;
    long long  ver = 0;
    long long  val = 0;
    stack<int>s;
    s.push(0);
    for(int i = 0;i<n;i++){
        cin>>val;
        if(val<min){
            min  = val;
            s.pop();
            s.push(i+1);
            ver = 0;
        }
        else if(val==min){
            min = val;
            ver = 1;
        }
    }
    if(ver == 0){
        cout<<s.top()<<endl;
    }
    else if(ver ==1){
        cout<<"Still Rozdil"<<endl;
    }
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main(){
    long int n;
    cin>>n;
    long long min = 10000000;
    long long  ver = 0;
    long long  val = 0;
    stack<int>s;
    s.push(0);
    for(int i = 0;i<n;i++){
        cin>>val;
        if(val<min){
            min  = val;
            s.pop();
            s.push(i+1);
        }
        else if(val==min){
            min = val;
            ver = 1;
            cout<<"Still Rozdil"<<endl;
            break;
        }
    }
    if(ver == 0){
        cout<<s.top()<<endl;
    }
}


#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin>>n;
    long int min = 10000000;
    int ver = 0;
    int val = 0;
    stack<int>s;
    s.push(0);
    for(int i = 0;i<n;i++){
        cin>>val;
        if(val<min){
            min  = val;
            s.pop();
            s.push(i+1);
        }
        if(val<=min){
            min = val;
            ver = 1;
            cout<<"Still Rozdil"<<endl;
            break;
        }
    }
    if(ver == 0){
        cout<<s.top()<<endl;
    }
}


#include <bits/stdc++.h>

using namespace std;

int main(){
    long int n;
    cin>>n;
    long long min = 10000000000000;
    long long  ver = 0;
    long long  val = 0;
    stack<int>s;
    s.push(0);
    for(int i = 0;i<n;i++){
        cin>>val;
        if(val<min){
            min  = val;
            s.pop();
            s.push(i+1);
        }
        else if(val==min){
            min = val;
            ver = 1;
            cout<<"Still Rozdil"<<endl;
            break;
        }
    }
    if(ver == 0){
        cout<<s.top()<<endl;
    }
}


#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin>>n;
    long int min = 10000000;
    int ver = 0;
    int val = 0;
    stack<int>s;
    s.push(0);
    for(int i = 0;i<n;i++){
        cin>>val;
        if(val<min){
            min  = val;
            s.pop();
            s.push(i+1);
        }
        else if(val==min){
            min = val;
            ver = 1;
            cout<<"Still Rozdil"<<endl;
            break;
        }
    }
    if(ver == 0){
        cout<<s.top()<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,mn=10000000,x,ans=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&x);
        if(x<mn)
        {
             mn=x;
             ans=i;
        }
        else if(x==mn) ans=-1;
        else;
    }

    if(ans==-1)
    printf("Still Rozdil\n");
    else
    printf("%d\n",ans);

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,mn=1000000000,x,ans=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        if(x<mn)
        {
             mn=x;
             ans=i;
        }
        else if(x==mn) ans=-1;
        else;
    }

    if(ans==-1)
    printf("Still Rozdil\n");
    else
    printf("%d\n",ans);

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,mn=10000000000,x,ans=0;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>n;
        if(x<mn)
        {
             mn=x;
             ans=i;
        }
        else if(x==mn) ans=-1;
        else;
    }

    if(ans==-1)
    cout<<"Still Rozdil"<<endl;
    else
    cout<<ans<<endl;

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,mn=10000000000,x,ans=0;
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>x;
        if(x<mn)
        {
             mn=x;
             ans=i;
        }
        else if(x==mn) ans=-1;
        else;
    }

    if(ans==-1)
        cout<<"Still Rozdil"<<endl;
    else
        cout<<ans<<endl;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,mn=10000000000,x,ans=0;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>x;
        if(x<mn)
        {
             mn=x;
             ans=i;
        }
        else if(x==mn) ans=-1;
        else;
    }

    if(ans==-1)
    cout<<"Still Rozdil"<<endl;
    else
    cout<<ans<<endl;

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,mn=1000000,x,ans=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        if(x<mn)
        {
             mn=x;
             ans=i;
        }
        else if(x==mn) ans=-1;
        else;
    }

    if(ans==-1)
    printf("Still Rozdil\n");
    else
    printf("%d\n",ans);

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,mn=100000000,x,ans=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        if(x<mn)
        {
             mn=x;
             ans=i;
        }
        else if(x==mn) ans=-1;
        else;
    }

    if(ans==-1)
    printf("Still Rozdil\n");
    else
    printf("%d\n",ans);

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,cnt=0,mn=0;
    cin>>n;
    int arr[n+1];
    for(i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    sort(arr,arr+n);
    for(i=0;i<n;i++)
    {
        if(arr[i]==arr[i+1])
            cnt=1;
        else
            mn=arr[0];
    }
    if(cnt==1)
        cout<<"Still Rozdil"<<endl;
    else
        cout<<mn;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,mn=10000000000,x,ans=0;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>x;
        if(x<mn)
        {
             mn=x;
             ans=i;
        }
        else if(x==mn) ans=-1;
        else;
    }

    if(ans==-1)
        cout<<"Still Rozdil"<<endl;
    else
        cout<<ans<<endl;
}


#include <bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define debug(x) cout<<#x<<"="<<x<<'\n' //"\n" is faster than endl"
#define display(x) cout<<x<<'\n'
#define precision(x,y)  cout<<fixed<<setprecision(y)<<x<<endl
void shm() {
#ifndef ONLINE_JUDGE
	freopen("D:\\cpp\\input.txt", "r", stdin);
	freopen("D:\\cpp\\output.txt", "w", stdout);
#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

void solve() {
	long n;
	cin >> n;
	vector<pair<long, long>> pii;
	long a;
	for (int i = 1; i <= n; i++) {
		cin >> a;
		pii.push_back(make_pair(a, i));
	}
	sort(pii.begin(), pii.end());
	bool flag = true;
	for (int i = 1; i < n; i++) {
		if (pii[i - 1].first == pii[i].first)
		{
			flag = false;
		}
	}
	if (flag)
	{	cout << pii[0].second << endl;

	} else {
		cout << "Still Rozdil" << endl;
	}
}

int main()
{
	shm();
	int tc = 1;
	//cin >> tc; //no of test cases

	while (tc != 0) {
		solve();//driver function
		tc--;
	}
}


#include <bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define debug(x) cout<<#x<<"="<<x<<'\n' //"\n" is faster than endl"
#define display(x) cout<<x<<'\n'
#define precision(x,y)  cout<<fixed<<setprecision(y)<<x<<endl
void shm() {
#ifndef ONLINE_JUDGE
	freopen("D:\\cpp\\input.txt", "r", stdin);
	freopen("D:\\cpp\\output.txt", "w", stdout);
#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

void solve() {
	long long n;
	cin >> n;
	vector<pair<long long, long long>> pii;
	long long a;
	for (int i = 1; i <= n; i++) {
		cin >> a;
		pii.push_back(make_pair(a, i));
	}
	sort(pii.begin(), pii.end());
	bool flag = true;
	if (pii[0].first == pii[1].first)
	{
		flag = false;
	}

	if (flag)
	{	cout << pii[0].second << endl;

	} else {
		cout << "Still Rozdil" << endl;
	}
}

int main()
{
	shm();
	int tc = 1;
	//cin >> tc; //no of test cases

	while (tc != 0) {
		solve();//driver function
		tc--;
	}
}


#include <bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define debug(x) cout<<#x<<"="<<x<<'\n' //"\n" is faster than endl"
#define display(x) cout<<x<<'\n'
#define precision(x,y)  cout<<fixed<<setprecision(y)<<x<<endl
void shm() {
#ifndef ONLINE_JUDGE
	freopen("D:\\cpp\\input.txt", "r", stdin);
	freopen("D:\\cpp\\output.txt", "w", stdout);
#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

void solve() {
	int n, time, min_time(1000000001), min_index(0), count(1);
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i)
	{
		scanf("%d", &time);
		if (time < min_time)
		{
			min_time = time;
			min_index = i;
			count = 1;
		}
		else if (time == min_time)
		{
			count += 1;
		}
	}
	if (count == 1)
	{
		printf("%d\n", min_index);
	}
	else
	{
		printf("Still Rozdil\n");
	}
}

int main()
{
	shm();
	int tc = 1;
	//cin >> tc; //no of test cases

	while (tc != 0) {
		solve();//driver function
		tc--;
	}
}


#include <bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define debug(x) cout<<#x<<"="<<x<<'\n' //"\n" is faster than endl"
#define display(x) cout<<x<<'\n'
#define precision(x,y)  cout<<fixed<<setprecision(y)<<x<<endl
void shm() {
#ifndef ONLINE_JUDGE
	freopen("D:\\cpp\\input.txt", "r", stdin);
	freopen("D:\\cpp\\output.txt", "w", stdout);
#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

void solve() {
	long long n;
	cin >> n;
	vector<pair<long long, long long>> pii;
	long lon a;
	for (int i = 1; i <= n; i++) {
		cin >> a;
		pii.push_back(make_pair(a, i));
	}
	sort(pii.begin(), pii.end());
	bool flag = true;
	if (pii[0].first == pii[1].first)
	{
		flag = false;
	}

	if (flag)
	{	cout << pii[0].second << endl;

	} else {
		cout << "Still Rozdil" << endl;
	}
}

int main()
{
	shm();
	int tc = 1;
	//cin >> tc; //no of test cases

	while (tc != 0) {
		solve();//driver function
		tc--;
	}
}


#include <bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define debug(x) cout<<#x<<"="<<x<<'\n' //"\n" is faster than endl"
#define display(x) cout<<x<<'\n'
#define precision(x,y)  cout<<fixed<<setprecision(y)<<x<<endl
void shm() {
#ifndef ONLINE_JUDGE
	freopen("D:\\cpp\\input.txt", "r", stdin);
	freopen("D:\\cpp\\output.txt", "w", stdout);
#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

void solve() {
	int n, time, min_time(1000000001), min_index(0), count(1);
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i)
	{
		scanf("%d", &time);
		if (time < min_time)
		{
			min_time = time;
			min_index = i;
		}
		else if (time == min_time)
		{
			count += 1;
		}
	}
	if (count == 1)
	{
		printf("%d\n", min_index);
	}
	else
	{
		printf("Still Rozdil\n");
	}
}

int main()
{
	shm();
	int tc = 1;
	//cin >> tc; //no of test cases

	while (tc != 0) {
		solve();//driver function
		tc--;
	}
}


#include<iostream>
using namespace std;
int main()
{
	int n,i=0;
	cin>>n;
	long int a;
	long temp = 1000000000;
	while(n--)
	{
		cin>>a;
		if(a<temp)
		{
			i++;
			temp = a;
		}
		else if(a==temp)
			{
				cout<<"Still Rozdil"<<endl;
				return 0;
			}
	}
	cout<<i<<endl;
	return 0;
}


#include<iostream>
using namespace std;
int main()
{
	int n,i=0;
	cin>>n;
	int a,b =n;
	int count =0;
	long int temp = 1000000001;
	while(n--)
	{
		cin>>a;
		if(a<temp)
		{
			temp = a;
			i = b-n;
			count=0;
		}
		else if(a==temp)
			{
			    count++;
			}

	}
	if(count>0)
	    cout<<"Still Rozdil"<<endl;
	else
	    cout<<i<<endl;
	return 0;
}


#include<iostream>
using namespace std;
int main()
{
	int n,i=0;
	cin>>n;
	int a,b =n;

	long int temp = 1000000000;
	while(n--)
	{
		cin>>a;
		if(a<temp)
		{
			temp = a;
			i = b-n;
		}
		else if(a==temp)
			{
				cout<<"Still Rozdil"<<endl;
				return 0;
			}

	}
	cout<<i<<endl;
	return 0;
}


#include<iostream>
using namespace std;
int main()
{
	int n,i=0;
	cin>>n;
	int a;
	long int temp = 1000000000;
	while(n--)
	{
		cin>>a;
		if(a<temp)
		{
			temp = a;
		}
		else if(a==temp)
			{
				cout<<"Still Rozdil"<<endl;
				return 0;
			}
			i++;
	}
	cout<<i<<endl;
	return 0;
}


#include<iostream>
using namespace std;
int main()
{
	int n,i=0;
	cin>>n;
	int a,b =n;
	int count =0;
	long int temp = 1000000000;
	while(n--)
	{
		cin>>a;
		if(a<temp)
		{
			temp = a;
			i = b-n;
			count=0;
		}
		else if(a==temp)
			{
			    count++;
			}

	}
	if(count>0)
	    cout<<"Still Rozdil"<<endl;
	else
	    cout<<i<<endl;
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define DEBUG if(1)
#define MAXN 50500
#define MAX 500
#define MAXL 20
#define MIN -2000000
#define INF (1 << 30)
#define MOD 1000000007
#define s(n) scanf("%d", &n)
#define ss(a,b) scanf("%d %d",&a,&b)
#define pb push_back
#define mp make_pair
#define sz(a) int(a.size())
// #define lli long long int
#define lli unsigned long long int
#define lb long double
#define rep(i,a,n) for (int i=a;i<n;i++)
#define ler(a,n,vec) for(int i=0;i<n;i++)s(a), vec.pb(a)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
#define F first
#define S second
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};

int n;
vector<lli> vec, vec2;
lli minn = 10000000000, pos = 0;
int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		lli a;
			cin >> a;
			if(a < minn) minn = a, pos = i;

			vec.pb(a);
			vec2.pb(a);
	}
	sort(vec.begin(), vec.end());
	for(int i=1;i<sz(vec);i++) if(vec[i] == vec[i-1]){
		cout << "Still Rozdil" << endl;
		return 0;
	}

	cout << pos + 1 << endl;

	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define DEBUG if(1)
#define MAXN 50500
#define MAX 500
#define MAXL 20
#define MIN -2000000
#define INF (1 << 30)
#define MOD 1000000007
#define s(n) scanf("%d", &n)
#define ss(a,b) scanf("%d %d",&a,&b)
#define pb push_back
#define mp make_pair
#define sz(a) int(a.size())
// #define lli long long int
#define lli unsigned long long int
#define lb long double
#define rep(i,a,n) for (int i=a;i<n;i++)
#define ler(a,n,vec) for(int i=0;i<n;i++)s(a), vec.pb(a)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
#define F first
#define S second
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};

int n;
vi vec;

int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		int a;
			cin >> a;
			vec.pb(a);
	}
	sort(vec.begin(), vec.end());
	for(int i=1;i<sz(vec);i++) if(vec[i] == vec[i-1]){
		cout << "Still Rozdil" << endl;
		return 0;
	}

	cout << n << endl;

	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define DEBUG if(1)
#define MAXN 50500
#define MAX 500
#define MAXL 20
#define MIN -2000000
#define INF (1 << 30)
#define MOD 1000000007
#define s(n) scanf("%d", &n)
#define ss(a,b) scanf("%d %d",&a,&b)
#define pb push_back
#define mp make_pair
#define sz(a) int(a.size())
// #define lli long long int
#define lli unsigned long long int
#define lb long double
#define rep(i,a,n) for (int i=a;i<n;i++)
#define ler(a,n,vec) for(int i=0;i<n;i++)s(a), vec.pb(a)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
#define F first
#define S second
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};

int n;
int vec[1000000];

int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		int a;
			cin >> a;
			if(vec[a]==0) vec[a] = 1;
			else{
				cout << "Still Rozdil" << endl;
				return 0;
			}
	}

	cout << n << endl;

	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define DEBUG if(1)
#define MAXN 50500
#define MAX 500
#define MAXL 20
#define MIN -2000000
#define INF (1 << 30)
#define MOD 1000000007
#define s(n) scanf("%d", &n)
#define ss(a,b) scanf("%d %d",&a,&b)
#define pb push_back
#define mp make_pair
#define sz(a) int(a.size())
// #define lli long long int
#define lli unsigned long long int
#define lb long double
#define rep(i,a,n) for (int i=a;i<n;i++)
#define ler(a,n,vec) for(int i=0;i<n;i++)s(a), vec.pb(a)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
#define F first
#define S second
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};

int n;
vector<lli> vec, vec2;
lli minn = 10000000000, pos = 0;
int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		lli a;
			cin >> a;
			if(a < minn) minn = a, pos = i;

			vec.pb(a);
			vec2.pb(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;
}


#include <bits/stdc++.h>

using namespace std;

#define DEBUG if(1)
#define MAXN 50500
#define MAX 500
#define MAXL 20
#define MIN -2000000
#define INF (1 << 30)
#define MOD 1000000007
#define s(n) scanf("%d", &n)
#define ss(a,b) scanf("%d %d",&a,&b)
#define pb push_back
#define mp make_pair
#define sz(a) int(a.size())
// #define lli long long int
#define lli unsigned long long int
#define lb long double
#define rep(i,a,n) for (int i=a;i<n;i++)
#define ler(a,n,vec) for(int i=0;i<n;i++)s(a), vec.pb(a)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
#define F first
#define S second
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};

int n;
vector<lli> vec;

int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		lli a;
			cin >> a;
			vec.pb(a);
	}
	sort(vec.begin(), vec.end());
	for(int i=1;i<sz(vec);i++) if(vec[i] == vec[i-1]){
		cout << "Still Rozdil" << endl;
		return 0;
	}

	cout << vec[0] << endl;

	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define DEBUG if(1)
#define MAXN 50500
#define MAX 500
#define MAXL 20
#define MIN -2000000
#define INF (1 << 30)
#define MOD 1000000007
#define s(n) scanf("%d", &n)
#define ss(a,b) scanf("%d %d",&a,&b)
#define pb push_back
#define mp make_pair
#define sz(a) int(a.size())
// #define lli long long int
#define lli unsigned long long int
#define lb long double
#define rep(i,a,n) for (int i=a;i<n;i++)
#define ler(a,n,vec) for(int i=0;i<n;i++)s(a), vec.pb(a)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
#define F first
#define S second
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};

int n;
vector<lli> vec, vec2;
lli minn = 10000000000, pos = 0;
int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		lli a;
			cin >> a;
			if(a < minn) minn = a, pos = i;

			vec.pb(a);
			vec2.pb(a);
	}

	if(n==1){
		cout << vec[0] << 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;
}


#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long int n;
    set<long long int> s;
    map<long long int,int> m;
    cin>>n;

    int a[n],b[n];

    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        b[a[i]]=i+1;
        s.insert(a[i]);
        m[a[i]]++;
    }

        if(m[*s.begin()]>1)
        {

            cout<<"Still Rozdil";

        }
        else
            cout<<b[*s.begin()];

    return 0;
}


#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long int n;
    set<long long int> s;
    map<long long int,int> m;
    cin>>n;

    int a[n],b[n];

    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        b[a[i]]=i+1;
        s.insert(a[i]);
        m[a[i]]++;
    }
    int temp=0;
    for(auto i:s)
        if(m[i]>1)
        {

            cout<<"Still Rozdil";
            temp=1;
            break;

        }

        if(temp==0)
            cout<<b[*s.begin()];

    return 0;
}


#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long int n;
    set<long long int> s;
    map<long long int,int> m;
    cin>>n;

    int a[n];

    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        s.insert(a[i]);
        m[a[i]]++;
    }

    if(m[*s.begin()]>1)
        cout<<"Still Rozdil";
        else
        cout<<*s.begin();

    return 0;
}


#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long int n;
    set<long long int> s;
    map<long long int,int> m;
    cin>>n;

    int a[n],b[1000000000];

    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        b[a[i]]=i+1;
        s.insert(a[i]);
        m[a[i]]++;
    }

        if(m[*s.begin()]>1)
        {

            cout<<"Still Rozdil";

        }
        else
            cout<<b[*s.begin()];

    return 0;
}


#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long int n;
    set<long long int> s;
    map<long long int,int> m,p;
    cin>>n;

    long long int a[n];

    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        s.insert(a[i]);
        m[a[i]]++;
        p[a[i]]=i+1;
    }

        if(m[*s.begin()]>1)
        {
            cout<<"Still Rozdil";
        }
        else
            cout<<p[*s.begin()];

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    #ifndef ONLINE JUDGE
       freopen("input.txt","r",stdin);
    #endif
     long long int i,j,n,x[100005],c,f,s,mn;
    while(cin>>n){
        long long int m=INFINITY;
        for(i=0;i<n;i++)
        {
            cin>>x[i];
             m=min(m,x[i]);
        }
        mn=INFINITY;
        c=0,f=0,s=1;

        for(i=0;i<n;i++)
        {
            if(x[i]<=mn)
            {
                mn=x[i];
                f=i;
                if(m==mn)
             {
               //cout<<m<<" "<<mn<<endl;
               c++;
              }
                //c++;
            }

        }
        if(c==1)
        {
            cout<<f+1<<endl;
        }
        else{
                cout<<"Still Rozdil"<<endl;
        }
    }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
   // #ifndef ONLINE JUDGE
       //freopen("input.txt","r",stdin);
    //#endif
     long long int i,j,n,x[100005],c,f,s,mn;
    while(cin>>n){
        vector<pair<int,int> > a;
        for(i=0;i<n;i++)
        {
            cin>>x[i];
            a.push_back(make_pair(x[i],i));
        }
        sort(a.begin(),a.end());
        if(a[0].first==a[1].first)
        {
           cout<<"Still Rozdil"<<endl;
        }
        else{
                 cout<<a[0].second+1<<endl;

        }
    }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
   // #ifndef ONLINE JUDGE
       freopen("input.txt","r",stdin);
    //#endif
     long long int i,j,n,x[100005],c,f,s,mn;
    while(cin>>n){
        vector<pair<int,int> > a;
        for(i=0;i<n;i++)
        {
            cin>>x[i];
            a.push_back(make_pair(x[i],i));
        }
        sort(a.begin(),a.end());
        if(a[0].first==a[1].first)
        {
           cout<<"Still Rozdil"<<endl;
        }
        else{
                 cout<<a[0].second+1<<endl;

        }
    }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    //#ifndef ONLINE JUDGE
       //freopen("input.txt","r",stdin);
    //#endif
     long long int i,j,n,x[100005],c,f,s,mn;
    while(cin>>n){
        long long int m=INFINITY;
        for(i=0;i<n;i++)
        {
            cin>>x[i];
             m=min(m,x[i]);
        }
        mn=INFINITY;
        c=0,f=0,s=1;

        for(i=0;i<n;i++)
        {
            if(x[i]<=mn)
            {
                mn=x[i];
                f=i;
                if(m==mn)
             {
               //cout<<m<<" "<<mn<<endl;
               c++;
              }
                //c++;
            }

        }
        if(c==1)
        {
            cout<<f+1<<endl;
        }
        else{
                cout<<"Still Rozdil"<<endl;
        }
    }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    //#ifndef ONLINE JUDGE
     //  freopen("input.txt","r",stdin);
    //#endif
     long long int i,j,n,x[100005],c,f,s,mn;
    while(cin>>n){
        for(i=0;i<n;i++)
        {
            cin>>x[i];
        }
        mn=INFINITY;
        c=0,f=0,s=1;
        for(i=0;i<n;i++)
        {
            if(x[i]==mn)
            {
                s=0;
                break;
            }
            else if(x[i]<mn)
            {
                mn=x[i];
                f=i;
                //c++;
            }
        }
        if(s==1)
        {
            cout<<f+1<<endl;
        }
        else{
                cout<<"Still Rozdil"<<endl;
        }
    }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    /*#ifndef ONLINE JUDGE
        freopen("input.txt","r",stdin);
    #endif*/
    int i,j,n,x[1005],c,f,s,mn;
    cin>>n;
        for(i=0;i<n;i++)
        {
            cin>>x[i];
        }
        mn=INFINITY;
        c=0,f=0,s=1;
        for(i=0;i<n;i++)
        {
            if(x[i]==mn)
            {
                s=0;
                break;
            }
            else if(x[i]<mn)
            {
                mn=x[i];
                f=i;
                //c++;
            }
        }
        if(s==1)
        {
            cout<<f+1<<endl;
        }
        else{
                cout<<"Still Rozdil"<<endl;
        }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    #ifndef ONLINE JUDGE
        freopen("input.txt","r",stdin);
    #endif
    int i,j,n,x[1005],c,f,s,mn;
    cin>>n;
        for(i=0;i<n;i++)
        {
            cin>>x[i];
        }
        mn=INFINITY;
        c=0,f=0,s=1;
        for(i=0;i<n;i++)
        {
            if(x[i]==mn)
            {
                s=0;
                break;
            }
            if(x[i]<mn)
            {
                mn=x[i];
                f=i;
                //c++;
            }
        }
        if(s==1)
        {
            cout<<f+1<<endl;
        }
        else{
                cout<<"Still Rozdil"<<endl;
        }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    #ifndef ONLINE JUDGE
        freopen("input.txt","r",stdin);
    #endif
    int i,j,n,x[1005],c,f,s,mn;
    cin>>n;
        for(i=0;i<n;i++)
        {
            cin>>x[i];
        }
        mn=INFINITY;
        c=0,f=0,s=1;
        for(i=0;i<n;i++)
        {
            if(x[i]==mn)
            {
                s=0;
                break;
            }
            else if(x[i]<mn)
            {
                mn=x[i];
                f=i;
                //c++;
            }
        }
        if(s==1)
        {
            cout<<f+1<<endl;
        }
        else{
                cout<<"Still Rozdil"<<endl;
        }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    #ifndef ONLINE JUDGE
        freopen("input.txt","r",stdin);
    #endif
    int i,j,n,x[1005],c,f,s,mn;
    while(cin>>n)
    {
        for(i=0;i<n;i++)
        {
            cin>>x[i];
        }
        mn=INFINITY;
        c=0,f=0,s=1;
        for(i=0;i<n;i++)
        {
            if(x[i]==mn)
            {
                s=0;
                break;
            }
            if(x[i]<mn)
            {
                mn=x[i];
                f=i;
                //c++;
            }
        }
        if(s==1)
        {
            cout<<f+1<<endl;
        }
        else{
                cout<<"Still Rozdil"<<endl;
        }

    }
    return 0;
}


#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
#define pb push_back
const int N=1e6;
int n,freq[N],mn=1e5+1,ans;
int main(){
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cin >>n;
    for(int x,i=0;i<n;i++){
        cin >>x;
        freq[x]++;
        if (x<mn){
            mn=x;
            ans =i+1;
        }
    }
    if (freq[mn]>1)cout <<"Still Rozdil" <<endl;
    else cout <<ans<<endl;
    return 0;
}


#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
const int N=1e6;
int n,freq[N],mn=1e5+1,ans;
int main(){
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cin >>n;
    for(int x,i=0;i<n;i++){
        cin >>x;
        freq[x]++;
        if (x<mn){
            mn=x;
            ans =i+1;
        }
    }
    if (freq[mn]>1)cout <<"Still Rozdil" <<endl;
    else cout <<ans<<endl;
    return 0;
}


#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
#define pb push_back
const int N=1e6;
int n,x[N],mn=1e5+1,ans;
int main(){
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cin >>n;
    for(int i=0;i<n;i++){
        cin >>x[i];
        if (mn>x[i]){
            ans=i+1;
            mn=x[i];
        }
    }
    sort(x,x+n);
    if (x[0]==x[1])cout <<"Still Rozdil" <<endl;
    else cout <<ans<<endl;
    return 0;
}


#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
#define pb push_back
const int N=1e6;
int n,x[N],mn=1e5+1,ans;
int main(){
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cin >>n;
    for(int i=0;i<n;i++){
        cin >>x[i];
        if (mn>x[i])ans =i+1;
    }
    sort(x,x+n);
    if (x[0]==x[1])cout <<"Still Rozdil" <<endl;
    else cout <<ans<<endl;
    return 0;
}


#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
#define pb push_back
const int N=1e6;
int n,x[N],mn=1e9+1,ans;
int main(){
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cin >>n;
    for(int i=0;i<n;i++){
        cin >>x[i];
        if (mn>x[i]){
            ans=i+1;
            mn=x[i];
        }
    }
    sort(x,x+n);
    if (x[0]==x[1])cout <<"Still Rozdil" <<endl;
    else cout <<ans<<endl;
    return 0;
}


#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
#define pb push_back
const int N=1e6;
int n,x[N],mn=1e5+1,ans;
int main(){
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cin >>n;
    for(int i=0;i<n;i++){
        cin >>x[i];
    }
    sort(x,x+n);
    if (x[0]==x[1])cout <<"Still Rozdil" <<endl;
    else cout <<ans<<endl;
    return 0;
}


#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<set>
using namespace std;
int main(void)
{

	int n,x,mn=1000000,index,count=1;
	cin>>n;

	for(int i=1;i<=n;++i)
	{
		cin>>x;
		if(x<mn)
		{
			mn=x;
			count=1;
			index=i;
		}
		else if(x==mn) {
			count++;
		}
	}
	if(count==1)
		cout<<index;
	else cout<<"Still Rozdil";

	return 0;
}


			#include<iostream>
			#include<vector>
			#include<string>
			#include<cmath>
			#include<algorithm>
			#include<set>
			using namespace std;
			int main(void)
			{

				long long  n,x,mn=10000000001,index,count=1;
				cin>>n;

				for(long long i=1;i<=n;++i)
				{
					cin>>x;
					if(x<mn)
					{
						mn=x;
						count=1;
						index=i;
					}
					else if(x==mn) {
						count++;
					}
				}
				if(count==1)
					cout<<index;
				else cout<<"Still Rozdil";

				return 0;
			}


#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<set>
using namespace std;
int main(void)
{

	int n,x,mn=1000000,index,count=1;
	cin>>n;

	for(int i=1;i<=n;++i)
	{
		cin>>x;
		if(x<mn)

		{
			mn=x;
			count=1;
			index=i;
		}
		else if(x==mn) {
			count++;
		}
	}
	if(count==1)
		cout<<index;
	else cout<<"Still Rozdil";

	return 0;
}


#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<set>
using namespace std;
int main(void)
{

int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;++i)
	cin>>v[i];

vector<int>v1=v;
sort(v.begin(),v.end());
if(v[0]==v[1])
	cout<<"Still Rozdil";
else {
	for(int i=0;i<n;++i)
	{
		if(v1[i]==v[0])
		{
			cout<<i+1;
			break;
		}
	}
}

	return 0;
}


	#include<iostream>
	#include<vector>
	#include<string>
	#include<cmath>
	#include<algorithm>
	#include<set>
	using namespace std;
	int main(void)
	{

		long long  n,x,mn=1000000,index,count=1;
		cin>>n;

		for(int i=1;i<=n;++i)
		{
			cin>>x;
			if(x<mn)
			{
				mn=x;
				count=1;
				index=i;
			}
			else if(x==mn) {
				count++;
			}
		}
		if(count==1)
			cout<<index;
		else cout<<"Still Rozdil";

		return 0;
	}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int n,i,flag=0,town=0;
	cin>>n;
	int a[n];
	cin>>a[0];
	int min=a[0];
	for(i=1;i<n;i++){
		cin>>a[i];
		if(a[i]<min){
			min=a[i];
			town=i+1;
		}
		else if(a[i]==min){
			flag=1;
			cout<<"Still Rozdil";
		}
	}
	if(flag==0){
		cout<<town;
	}

}


#include<bits/stdc++.h>
using namespace std;

int main(){
	long long int n,i,flag=0,town=1,mincount=0;
	cin>>n;
	long long int a[n];
	cin>>a[0];
	if(n==1){
		cout<<1;
	}
	else{

		int min=a[0];

		for(i=1;i<n;i++){
			cin>>a[i];
			if(a[i]<min){
				mincount=0;
				min=a[i];
				town=i+1;
			}
			else if(a[i]==min){
				mincount++;
			}
		}

		if(mincount==0){
		cout<<town;
		}
		else{
			cout<<"Still Rozdil";
		}

	}

}


#include<bits/stdc++.h>
using namespace std;

int main(){
	long long int n,i,flag=0,town=0,mincount=0;
	cin>>n;
	long long int a[n];
	cin>>a[0];
	if(n==1){
		cout<<1;
	}
	else{

		int min=a[0];
		for(i=1;i<n;i++){
			cin>>a[i];
			if(a[i]<min){
				mincount=0;
				min=a[i];
				town=i+1;
			}
			else if(a[i]==min){
				mincount++;
			}
		}

		if(mincount==0){
		cout<<town;
		}
		else{
			cout<<"Still Rozdil";
		}

	}

}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int n,i,flag=0,town=0;
	cin>>n;
	int a[n];
	cin>>a[0];
	if(n==1){
		cout<<1;
	}
	else{

		int min=a[0];
		for(i=1;i<n;i++){
			cin>>a[i];
			if(a[i]<min){
				min=a[i];
				town=i+1;
			}

			else if(a[i]==min){
				flag=1;
				cout<<"Still Rozdil";
				break;
			}
		}
		if(flag==0){
		cout<<town;
		}

	}

}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int n,i,flag=0,town=0;
	cin>>n;
	int a[n];
	cin>>a[0];
	if(n==1){
		cout<<1;
	}
	else{

		int min=a[0];
		for(i=1;i<n;i++){
			cin>>a[i];
			if(a[i]<min){
				min=a[i];
				town=i+1;
			}

			else if(a[i]==min){
				flag=1;
				cout<<"Still Rozdil";
			}
		}
		if(flag==0){
		cout<<town;
		}

	}

}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int n,i,flag=0,town=0,mincount=0;
	cin>>n;
	int a[n];
	cin>>a[0];
	if(n==1){
		cout<<1;
	}
	else{

		int min=a[0];
		for(i=1;i<n;i++){
			cin>>a[i];
			if(a[i]<min){
				mincount=0;
				min=a[i];
				town=i+1;
			}
			else if(a[i]==min){
				mincount++;
			}
		}

		if(mincount==0){
		cout<<town;
		}
		else{
			cout<<"Still Rozdil";
		}

	}

}


 /*........................................
       .   *BISMIllAHIR RAHMANIR RAHIM*   .
       .       *ALLAH* is Almighty        .
       ....................................
 ********************************************
 *   . . . . . . . . . . . . . . . . . ..   *
 *   .  solved_by: zitul_mahmud;        .   *
 *   .  Applied_physics_electronics     .   *
 *   .  & communication_engineering;    .   *
 *   .  Islamic university,kushtia;     .   *
 *   .  zitulmahmud88@gmail.com;        .   *
 *   .  "STAY HUNGRY STAY FOOLISH"      .   *
 *   . . . . . . . . . . . . . . . . . ..   *
 ********************************************/

# include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;

# define PI       2*acos(0.0)
# define MOD      1000000007
# define sz       100002                          /*array_size*/
# define FF       first
# define SS       second
# define PB       push_back
# define MP       make_pair                       /*make_pair()*/
# define all(x)   (x).begin(),(x).end()           /*sorting STL */
#define RAD       (PI/180.00)

/*Input section*/
# define si(a) scanf("%d",&a)
# define sii(a,b) scanf("%d %d",&a,&b)
# define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)

# define sl(a) scanf("%lld",&a);
# define sll(a,b) scanf("%lld %lld",&a,&b);
# define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

# define FR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)     /*for_loop for long long data_type a<b*/
# define FRR(i,a,b) for(ll i=(ll)a;i<=(ll)b;i++)   /*for_loop for long long data_type a<=b*/
# define RF(i,b,a) for(ll i=(ll)b-1;i>=(ll)a;i--)
# define RRF(i,b,a) for(ll i=(ll)b;i>=(ll)a;i--)

/*Output section*/
# define SP printf(" ")
# define NL printf("\n")
# define CH getchar()
# define pi(a) printf("%d\n",a)
# define pii(a,b) printf("%d %d\n",a,b)
# define piii(a,b,c) printf("%d %d %d\n",a,b,c)
# define fast ios_base:: sync_with_stdio(0),cin.tie(0)
# define IT(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)    /*to iterate the iterator*/

//defined function has gone here
/*********************************************************************************/

void sss(string s)           {cout<<s,NL;}                                   //print the single string
ll string_to_ll(string s)    {stringstream ss;ss<<s;ll n;ss>>n;return n;}    //string to ll converter
string ll_to_string(ll n)    {stringstream ss;ss<<n;string s;ss>>s;return s;}//ll to string converter

/*********************************************************************************/
/*my function has gone here*/

set < ll > s;

/*main (function) has gone here.....*/
int main()
{
        ll n,i,ara[sz],mn;
        sl(n);
        FR(i,0,n)
        {
               sl(ara[i]);
               s.insert(ara[i]);
        }
        if(n!=s.size()) sss("Still Rozdil");
        else
        {
              mn=*min_element(ara,ara+n);
              FR(i,0,n)
              {
                     if(ara[i]==mn)
                     {
                            printf("%lld\n",i+1);
                            break;
                     }
              }
        }
        s.clear();
        return 0;
}

/*   If you want to shine like a sun. First burn like a sun   */


 /*........................................
       .   *BISMIllAHIR RAHMANIR RAHIM*   .
       .       *ALLAH* is Almighty        .
       ....................................
 ********************************************
 *   . . . . . . . . . . . . . . . . . ..   *
 *   .  solved_by: zitul_mahmud;        .   *
 *   .  Applied_physics_electronics     .   *
 *   .  & communication_engineering;    .   *
 *   .  Islamic university,kushtia;     .   *
 *   .  zitulmahmud88@gmail.com;        .   *
 *   .  "STAY HUNGRY STAY FOOLISH"      .   *
 *   . . . . . . . . . . . . . . . . . ..   *
 ********************************************/

# include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;

# define PI       2*acos(0.0)
# define MOD      1000000007
# define sz       1000001                          /*array_size*/
# define FF       first
# define SS       second
# define PB       push_back
# define MP       make_pair                       /*make_pair()*/
# define all(x)   (x).begin(),(x).end()           /*sorting STL */
#define RAD       (PI/180.00)

/*Input section*/
# define si(a) scanf("%d",&a)
# define sii(a,b) scanf("%d %d",&a,&b)
# define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)

# define sl(a) scanf("%lld",&a);
# define sll(a,b) scanf("%lld %lld",&a,&b);
# define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

# define FR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)     /*for_loop for long long data_type a<b*/
# define FRR(i,a,b) for(ll i=(ll)a;i<=(ll)b;i++)   /*for_loop for long long data_type a<=b*/
# define RF(i,b,a) for(ll i=(ll)b-1;i>=(ll)a;i--)
# define RRF(i,b,a) for(ll i=(ll)b;i>=(ll)a;i--)

/*Output section*/
# define SP printf(" ")
# define NL printf("\n")
# define CH getchar()
# define pi(a) printf("%d\n",a)
# define pii(a,b) printf("%d %d\n",a,b)
# define piii(a,b,c) printf("%d %d %d\n",a,b,c)
# define fast ios_base:: sync_with_stdio(0),cin.tie(0)
# define IT(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)    /*to iterate the iterator*/

//defined function has gone here
/*********************************************************************************/

void sss(string s)           {cout<<s,NL;}                                   //print the single string
ll string_to_ll(string s)    {stringstream ss;ss<<s;ll n;ss>>n;return n;}    //string to ll converter
string ll_to_string(ll n)    {stringstream ss;ss<<n;string s;ss>>s;return s;}//ll to string converter

/*********************************************************************************/
/*my function has gone here*/

vector < ll > v;

/*main (function) has gone here.....*/
int main()
{
        ll n,i,ara[sz],c,mn=100000009,index;
        sl(n);
        FR(i,0,n)
        {
               sl(ara[i]);
               if(ara[i]<=mn)
               {
                     mn=ara[i];
                     index=i+1;
               }
        }
        v.assign(ara,ara+n);
        c= count(all(v),mn);
        if(c>1) sss("Still Rozdil");
        else printf("%lld\n",index);
        return 0;
}

/*   If you want to shine like a sun. First burn like a sun   */


 /*........................................
       .   *BISMIllAHIR RAHMANIR RAHIM*   .
       .       *ALLAH* is Almighty        .
       ....................................
 ********************************************
 *   . . . . . . . . . . . . . . . . . ..   *
 *   .  solved_by: zitul_mahmud;        .   *
 *   .  Applied_physics_electronics     .   *
 *   .  & communication_engineering;    .   *
 *   .  Islamic university,kushtia;     .   *
 *   .  zitulmahmud88@gmail.com;        .   *
 *   .  "STAY HUNGRY STAY FOOLISH"      .   *
 *   . . . . . . . . . . . . . . . . . ..   *
 ********************************************/

# include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;

# define PI       2*acos(0.0)
# define MOD      1000000007
# define sz       1000001                          /*array_size*/
# define FF       first
# define SS       second
# define PB       push_back
# define MP       make_pair                       /*make_pair()*/
# define all(x)   (x).begin(),(x).end()           /*sorting STL */
#define RAD       (PI/180.00)

/*Input section*/
# define si(a) scanf("%d",&a)
# define sii(a,b) scanf("%d %d",&a,&b)
# define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)

# define sl(a) scanf("%lld",&a);
# define sll(a,b) scanf("%lld %lld",&a,&b);
# define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

# define FR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)     /*for_loop for long long data_type a<b*/
# define FRR(i,a,b) for(ll i=(ll)a;i<=(ll)b;i++)   /*for_loop for long long data_type a<=b*/
# define RF(i,b,a) for(ll i=(ll)b-1;i>=(ll)a;i--)
# define RRF(i,b,a) for(ll i=(ll)b;i>=(ll)a;i--)

/*Output section*/
# define SP printf(" ")
# define NL printf("\n")
# define CH getchar()
# define pi(a) printf("%d\n",a)
# define pii(a,b) printf("%d %d\n",a,b)
# define piii(a,b,c) printf("%d %d %d\n",a,b,c)
# define fast ios_base:: sync_with_stdio(0),cin.tie(0)
# define IT(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)    /*to iterate the iterator*/

//defined function has gone here
/*********************************************************************************/

void sss(string s)           {cout<<s,NL;}                                   //print the single string
ll string_to_ll(string s)    {stringstream ss;ss<<s;ll n;ss>>n;return n;}    //string to ll converter
string ll_to_string(ll n)    {stringstream ss;ss<<n;string s;ss>>s;return s;}//ll to string converter

/*********************************************************************************/
/*my function has gone here*/

/*main (function) has gone here.....*/
int main()
{
        ll n,i,ara[sz],c(0),mn=1000000009,index;
        sl(n);
        FR(i,0,n)
        {
               sl(ara[i]);
               if(ara[i]<=mn)
               {
                     mn=ara[i];
               }
        }
        for(i=0;i<n;i++)
        {
               if(mn==ara[i])
               {
                      c++;
                      index=i+1;
               }
        }
        if(c>1) sss("Still Rozdil");
        else printf("%lld\n",index);
        return 0;
}

/*   If you want to shine like a sun. First burn like a sun   */


 /*........................................
       .   *BISMIllAHIR RAHMANIR RAHIM*   .
       .       *ALLAH* is Almighty        .
       ....................................
 ********************************************
 *   . . . . . . . . . . . . . . . . . ..   *
 *   .  solved_by: zitul_mahmud;        .   *
 *   .  Applied_physics_electronics     .   *
 *   .  & communication_engineering;    .   *
 *   .  Islamic university,kushtia;     .   *
 *   .  zitulmahmud88@gmail.com;        .   *
 *   .  "STAY HUNGRY STAY FOOLISH"      .   *
 *   . . . . . . . . . . . . . . . . . ..   *
 ********************************************/

# include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;

# define PI       2*acos(0.0)
# define MOD      1000000007
# define sz       1000001                          /*array_size*/
# define FF       first
# define SS       second
# define PB       push_back
# define MP       make_pair                       /*make_pair()*/
# define all(x)   (x).begin(),(x).end()           /*sorting STL */
#define RAD       (PI/180.00)

/*Input section*/
# define si(a) scanf("%d",&a)
# define sii(a,b) scanf("%d %d",&a,&b)
# define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)

# define sl(a) scanf("%lld",&a);
# define sll(a,b) scanf("%lld %lld",&a,&b);
# define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

# define FR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)     /*for_loop for long long data_type a<b*/
# define FRR(i,a,b) for(ll i=(ll)a;i<=(ll)b;i++)   /*for_loop for long long data_type a<=b*/
# define RF(i,b,a) for(ll i=(ll)b-1;i>=(ll)a;i--)
# define RRF(i,b,a) for(ll i=(ll)b;i>=(ll)a;i--)

/*Output section*/
# define SP printf(" ")
# define NL printf("\n")
# define CH getchar()
# define pi(a) printf("%d\n",a)
# define pii(a,b) printf("%d %d\n",a,b)
# define piii(a,b,c) printf("%d %d %d\n",a,b,c)
# define fast ios_base:: sync_with_stdio(0),cin.tie(0)
# define IT(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)    /*to iterate the iterator*/

//defined function has gone here
/*********************************************************************************/

void sss(string s)           {cout<<s,NL;}                                   //print the single string
ll string_to_ll(string s)    {stringstream ss;ss<<s;ll n;ss>>n;return n;}    //string to ll converter
string ll_to_string(ll n)    {stringstream ss;ss<<n;string s;ss>>s;return s;}//ll to string converter

/*********************************************************************************/
/*my function has gone here*/

/*main (function) has gone here.....*/
int main()
{
        ll n,i,ara[sz],c(0),mn=100000009,index;
        sl(n);
        FR(i,0,n)
        {
               sl(ara[i]);
               if(ara[i]<=mn)
               {
                     mn=ara[i];
               }
        }
        for(i=0;i<n;i++)
        {
               if(mn==ara[i])
               {
                      c++;
                      index=i+1;
               }
        }
        if(c>1) sss("Still Rozdil");
        else printf("%lld\n",index);
        return 0;
}

/*   If you want to shine like a sun. First burn like a sun   */


 /*........................................
       .   *BISMIllAHIR RAHMANIR RAHIM*   .
       .       *ALLAH* is Almighty        .
       ....................................
 ********************************************
 *   . . . . . . . . . . . . . . . . . ..   *
 *   .  solved_by: zitul_mahmud;        .   *
 *   .  Applied_physics_electronics     .   *
 *   .  & communication_engineering;    .   *
 *   .  Islamic university,kushtia;     .   *
 *   .  zitulmahmud88@gmail.com;        .   *
 *   .  "STAY HUNGRY STAY FOOLISH"      .   *
 *   . . . . . . . . . . . . . . . . . ..   *
 ********************************************/

# include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;

# define PI       2*acos(0.0)
# define MOD      1000000007
# define sz       1000001                          /*array_size*/
# define FF       first
# define SS       second
# define PB       push_back
# define MP       make_pair                       /*make_pair()*/
# define all(x)   (x).begin(),(x).end()           /*sorting STL */
#define RAD       (PI/180.00)

/*Input section*/
# define si(a) scanf("%d",&a)
# define sii(a,b) scanf("%d %d",&a,&b)
# define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)

# define sl(a) scanf("%lld",&a);
# define sll(a,b) scanf("%lld %lld",&a,&b);
# define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

# define FR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)     /*for_loop for long long data_type a<b*/
# define FRR(i,a,b) for(ll i=(ll)a;i<=(ll)b;i++)   /*for_loop for long long data_type a<=b*/
# define RF(i,b,a) for(ll i=(ll)b-1;i>=(ll)a;i--)
# define RRF(i,b,a) for(ll i=(ll)b;i>=(ll)a;i--)

/*Output section*/
# define SP printf(" ")
# define NL printf("\n")
# define CH getchar()
# define pi(a) printf("%d\n",a)
# define pii(a,b) printf("%d %d\n",a,b)
# define piii(a,b,c) printf("%d %d %d\n",a,b,c)
# define fast ios_base:: sync_with_stdio(0),cin.tie(0)
# define IT(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)    /*to iterate the iterator*/

//defined function has gone here
/*********************************************************************************/

void sss(string s)           {cout<<s,NL;}                                   //print the single string
ll string_to_ll(string s)    {stringstream ss;ss<<s;ll n;ss>>n;return n;}    //string to ll converter
string ll_to_string(ll n)    {stringstream ss;ss<<n;string s;ss>>s;return s;}//ll to string converter

/*********************************************************************************/
/*my function has gone here*/

vector < ll > v;

/*main (function) has gone here.....*/
int main()
{
        ll n,i,ara[sz],c,mn=1000000009,index;
        sl(n);
        FR(i,0,n)
        {
               sl(ara[i]);
               if(ara[i]<=mn)
               {
                     mn=ara[i];
                     index=i;
               }
        }
        v.assign(ara,ara+n);
        c=count(all(v),mn);
        if(c>1) sss("Still Rozdil");
        else printf("%lld\n",index+1);
        v.clear();
        return 0;
}

/*   If you want to shine like a sun. First burn like a sun   */


 /*........................................
       .   *BISMIllAHIR RAHMANIR RAHIM*   .
       .       *ALLAH* is Almighty        .
       ....................................
 ********************************************
 *   . . . . . . . . . . . . . . . . . ..   *
 *   .  solved_by: zitul_mahmud;        .   *
 *   .  Applied_physics_electronics     .   *
 *   .  & communication_engineering;    .   *
 *   .  Islamic university,kushtia;     .   *
 *   .  zitulmahmud88@gmail.com;        .   *
 *   .  "STAY HUNGRY STAY FOOLISH"      .   *
 *   . . . . . . . . . . . . . . . . . ..   *
 ********************************************/

# include<bits/stdc++.h>
using namespace std;

# define FF       first
# define sz       100002   //array size
# define SS       second
# define PB       push_back
# define MP       make_pair
# define PI       2*acos(0.0)
# define MOD      1000000007
# define all(x)   (x).begin(),(x).end()  //sorting STL

/*Input section*/
typedef double dl;
typedef long long ll;
# define si(a) scanf("%d",&a)
# define sii(a,b) scanf("%d %d",&a,&b)
# define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)

# define sl(a) scanf("%lld",&a);
# define sll(a,b) scanf("%lld %lld",&a,&b);
# define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

# define FR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)     //for_loop for long long data_type a<b
# define FRR(i,a,b) for(ll i=(ll)a;i<=(ll)b;i++)   //for_loop for long long data_type a<=b
# define RF(i,b,a) for(ll i=(ll)b-1;i>=(ll)a;i--)
# define RRF(i,b,a) for(ll i=(ll)b;i>=(ll)a;i--)

/*Output section*/
# define CH getchar()
# define SP printf(" ")
# define NL printf("\n")
# define pi(a) printf("%d\n",a)
# define DBG printf("I AM HERE\n") //check_for_debug
# define pii(a,b) printf("%d %d\n",a,b)
# define piii(a,b,c) printf("%d %d %d\n",a,b,c)
# define fast ios_base:: sync_with_stdio(0),cin.tie(0)
# define IT(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)    /*to iterate the iterator*/

//defined function has gone here
/*********************************************************************************/

void sss(string s)           {cout<<s,NL;}                                   //print the single string
ll string_to_ll(string s)    {stringstream ss;ss<<s;ll n;ss>>n;return n;}    //string to ll converter
string ll_to_string(ll n)    {stringstream ss;ss<<n;string s;ss>>s;return s;}//ll to string converter

/*********************************************************************************/
/*my function has gone here*/

/*main function has gone here*/
int main()
{

       return 0;
}

/*   If you want to shine like a sun. First burn like a sun   */


 /*........................................
       .   *BISMIllAHIR RAHMANIR RAHIM*   .
       .       *ALLAH* is Almighty        .
       ....................................
 ********************************************
 *   . . . . . . . . . . . . . . . . . ..   *
 *   .  solved_by: zitul_mahmud;        .   *
 *   .  Applied_physics_electronics     .   *
 *   .  & communication_engineering;    .   *
 *   .  Islamic university,kushtia;     .   *
 *   .  zitulmahmud88@gmail.com;        .   *
 *   .  "STAY HUNGRY STAY FOOLISH"      .   *
 *   . . . . . . . . . . . . . . . . . ..   *
 ********************************************/

# include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;

# define PI       2*acos(0.0)
# define MOD      1000000007
# define sz       1000000                          /*array_size*/
# define FF       first
# define SS       second
# define PB       push_back
# define MP       make_pair                       /*make_pair()*/
# define all(x)   (x).begin(),(x).end()           /*sorting STL */
#define RAD       (PI/180.00)

/*Input section*/
# define si(a) scanf("%d",&a)
# define sii(a,b) scanf("%d %d",&a,&b)
# define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)

# define sl(a) scanf("%lld",&a);
# define sll(a,b) scanf("%lld %lld",&a,&b);
# define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

# define FR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)     /*for_loop for long long data_type a<b*/
# define FRR(i,a,b) for(ll i=(ll)a;i<=(ll)b;i++)   /*for_loop for long long data_type a<=b*/
# define RF(i,b,a) for(ll i=(ll)b-1;i>=(ll)a;i--)
# define RRF(i,b,a) for(ll i=(ll)b;i>=(ll)a;i--)

/*Output section*/
# define SP printf(" ")
# define NL printf("\n")
# define CH getchar()
# define pi(a) printf("%d\n",a)
# define pii(a,b) printf("%d %d\n",a,b)
# define piii(a,b,c) printf("%d %d %d\n",a,b,c)
# define fast ios_base:: sync_with_stdio(0),cin.tie(0)
# define IT(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)    /*to iterate the iterator*/

//defined function has gone here
/*********************************************************************************/

void sss(string s)           {cout<<s,NL;}                                   //print the single string
ll string_to_ll(string s)    {stringstream ss;ss<<s;ll n;ss>>n;return n;}    //string to ll converter
string ll_to_string(ll n)    {stringstream ss;ss<<n;string s;ss>>s;return s;}//ll to string converter

/*********************************************************************************/
/*my function has gone here*/

set < ll > s;

/*main (function) has gone here.....*/
int main()
{
        ll n,i,ara[sz],mn=100000001,index;
        sl(n);
        FR(i,0,n)
        {
               sl(ara[i]);
               s.insert(ara[i]);
               if(ara[i]<=mn)
               {
                     mn=min(mn,ara[i]);
                     index=i;
               }
        }
        if(n!=s.size()) sss("Still Rozdil");
        else printf("%lld\n",index+1);
        s.clear();
        return 0;
}

/*   If you want to shine like a sun. First burn like a sun   */


#include<bits/stdc++.h>
#include<cmath>
#include<iostream>

using namespace std;

int main() {

    int n;

    cin>>n;

  long long int a[n];

    long long int b[n];

    int i;

    for(i=0;i<n;i++) {
        cin>>a[i];
        b[i]=a[i];
    }

    sort(a,a+n);

    int min=a[0];

    if(n==1) {
        cout<<n;
    }

    else if(n==2) {
        if(a[0]>a[1]) {
            if(a[1]==b[0]){
                cout<<1;
            }
            else {
                cout<<2;
            }
        }
            else if(a[1]>a[0]) {
                if(a[0]==b[0]) {
                    cout<<1;
                }
                else {
                    cout<<2;
                }
            }
        }

  else {  for(i=1;i<n;i++) {
        if(a[i]==min) {
            cout<<"Still Rozdil";
            break;
        }

        else if(b[i]==min) {
            cout<<i+1;
            break;
        }
    }
  }
    return 0;
}


#include<bits/stdc++.h>
#include<cmath>
#include<iostream>

using namespace std;

int main() {

    int n;

    cin>>n;

    int a[n];

    int b[n];

    int i;

    for(i=0;i<n;i++) {
        cin>>a[i];
        b[i]=a[i];
    }

    sort(a,a+n);

    int min=a[0];

    if(n==1) {
        cout<<n;
    }

  else {  for(i=1;i<n;i++) {
        if(a[i]==min) {
            cout<<"Still Rozdil";
            break;
        }

        else if(b[i]==min) {
            cout<<i+1;
            break;
        }
    }
  }
    return 0;
}


#include<bits/stdc++.h>
#include<cmath>
#include<iostream>

using namespace std;

int main() {

    int n;

    cin>>n;

  long long int a[n];

    long long int b[n];

    int i;

    for(i=0;i<n;i++) {
        cin>>a[i];
        b[i]=a[i];
    }

    sort(a,a+n);

    int min=a[0];

    if(n==1) {
        cout<<n;
    }

    else if(n==2&&a[0]!=a[1]) {
        if(a[0]>a[1]) {
            if(a[1]==b[0]){
                cout<<1;
            }
            else {
                cout<<2;
            }
        }
            else if(a[1]>a[0]) {
                if(a[0]==b[0]) {
                    cout<<1;
                }
                else {
                    cout<<2;
                }
            }
        }

  else {  for(i=1;i<n;i++) {
        if(a[i]==min) {
            cout<<"Still Rozdil";
            break;
        }

        else if(b[i]==min) {
            cout<<i+1;
            break;
        }
    }
  }
    return 0;
}


#include<bits/stdc++.h>
#include<cmath>
#include<iostream>

using namespace std;

int main() {

    int n;

    cin>>n;

    int a[n];

    int b[n];

    int i;

    for(i=0;i<n;i++) {
        cin>>a[i];
        b[i]=a[i];
    }

    sort(a,a+n);

    int min=a[0];

    for(i=1;i<n;i++) {
        if(a[i]==min) {
            cout<<"Still Rozdil";
            break;
        }

        else if(b[i]==min) {
            cout<<i+1;
            break;
        }
    }

    return 0;
}


#include<bits/stdc++.h>
#include<cmath>
#include<iostream>

using namespace std;

int main() {

    int n;

    cin>>n;

  long long int a[n];

    long long int b[n];

    int i;

    for(i=0;i<n;i++) {
        cin>>a[i];
        b[i]=a[i];
    }

    sort(a,a+n);

    int min=a[0];

    if(n==1) {
        cout<<n;
    }

    else if(n==2&&a[0]!=a[1]) {
        if(a[0]>a[1]) {
            if(a[1]==b[0]){
                cout<<1;
            }
            else {
                cout<<2;
            }
        }
            else if(a[1]>a[0]) {
                if(a[0]==b[0]) {
                    cout<<1;
                }
                else {
                    cout<<2;
                }
            }
        }

        else if((n==3)&&(a[0]!=a[1]&&a[1]!=a[2]&&a[2]!=a[0])) {

                cout<<a[0];

        }

  else {  for(i=1;i<n;i++) {
        if(a[i]==min) {
            cout<<"Still Rozdil";
            break;
        }

        else if(b[i]==min) {
            cout<<i+1;
            break;
        }
    }
  }
    return 0;
}


#include<bits/stdc++.h>
#include<cmath>
#include<iostream>

using namespace std;

int main() {

    int n;

    cin>>n;

  long long int a[n];

    long long int b[n];

    int i;

    for(i=0;i<n;i++) {
        cin>>a[i];
        b[i]=a[i];
    }

    sort(a,a+n);

    int min=a[0];

    if(n==1) {
        cout<<n;
    }

  else {  for(i=1;i<n;i++) {
        if(a[i]==min) {
            cout<<"Still Rozdil";
            break;
        }

        else if(b[i]==min) {
            cout<<i+1;
            break;
        }
    }
  }
    return 0;
}


#include<bits/stdc++.h>
#include<cmath>
#include<iostream>

using namespace std;

int main() {

    int n;

    cin>>n;

  long long int a[n];

    long long int b[n];

    int i;

    for(i=0;i<n;i++) {
        cin>>a[i];
        b[i]=a[i];
    }

    sort(a,a+n);

    int min=a[0];

    if(n==1) {
        cout<<n;
    }

    else if(n==2&&a[0]!=a[1]) {
        if(a[0]>a[1]) {
            if(a[1]==b[0]){
                cout<<1;
            }
            else {
                cout<<2;
            }
        }
            else if(a[1]>a[0]) {
                if(a[0]==b[0]) {
                    cout<<1;
                }
                else {
                    cout<<2;
                }
            }
        }

        else if(n==3) {
            if(a[0]!=a[1]&&a[1]!=a[2]&&a[2]!=a[0]) {
                cout<<a[0];
            }
        }

  else {  for(i=1;i<n;i++) {
        if(a[i]==min) {
            cout<<"Still Rozdil";
            break;
        }

        else if(b[i]==min) {
            cout<<i+1;
            break;
        }
    }
  }
    return 0;
}


#include <bits/stdc++.h>

using namespace std;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<VI> VII;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);

    int N;
    map<int,int> mmap;
    bool bad = false;
    cin >> N;

    for(int i = 0; i < N; i++){
        int dummy;
        cin >> dummy;
        if(mmap[dummy] > 0) bad = true;
        mmap[dummy] = i + 1;
    }

    if(bad) cout << "Still Rozdil" << endl;
    else{
        auto l = mmap.begin();
        cout << l->second << endl;
    }

    return 0;
}