florr.io真号玩；

#include<bits/stdc++.h> 
#define int long long
using namespace std;
int a[100005];
bool flag[100005];
signed main()
{
	int n;
	cin>>n;
	int i;
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	int florr=0;
	flag[0]=1;
	for(i=0;i<n;i++)
	{
		florr=(a[florr]+florr+n*1000)%n;
		if(flag[florr]==1)
		{
			cout<<i+1<<' '<<florr+1;
			return 0;
		}
		flag[florr]=1;
	}
	cout<<i+1<<' '<<florr+1;
}