1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

/*
ID:du331691
PROG:hidden
LANG:C++
*/
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cctype>
using namespace std;
const int maxn=100003*2;
int n;
char s[maxn];
void input()
{
	scanf("%d",&n);
	for(int i=0;i<n;++i)
	{
		char r;
		do{r=getchar();}
		while(!islower(r));
		s[i]=s[i+n]=r;
	}
}
int ans;
void solve()
{
	int i=0,j=1;
	while(j<=n)
	{
		bool ok=true;
		for(int k=0;k<=n-1&&ok;++k)
		{
			if(s[i+k]!=s[j+k])
			{
				ok=false;
				if(s[i+k]>s[j+k])
					i=i+k+1;
				else j=j+k+1;
			}
		}
		if(ok)
		{
			ans=i;
			return;
		}
		if(i==j)++j;
	}
	ans=i;
}
int main()
{
	freopen("hidden.in","r",stdin);
	freopen("hidden.out","w",stdout);
	input();
	solve();
	printf("%d\n",ans);
	return 0;
}