#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#define MAXN 5000010

using namespace std;

int n,len,ans,l,r;

char s[MAXN],c;

int main(){

    scanf("%d",&n);

    n--;

    for(int i=;i<=n;i++){

        cin>>c;

        s[i]=c;

    }

    for(int i=;i<=n;i++){

        l=ans;r=i;

        while(s[l]==s[r]){

            l++;r++;

            if(l>n)    l=;

            if(r>n)    r=;

            if(r==i)    break;

        }

        if(s[l]>s[r])    ans=i;

    }

    printf("%d",ans);

}

/*

7

alabala

*/

90分的暴力

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

const int maxn=;

int n;

char s[maxn];

int Mini(int l){

    int i,j,k;

    i=;j=;k=;

    while(i<l&&j<l){

        k=;

        while(s[(i+k)%l]==s[(j+k)%l]&&k<l)    k++;

        if(k==l)    return    (i<j)?i:j;

        if(s[(i+k)%l]>s[(j+k)%l])    i=i+k+;

        else    j=j+k+;

        if(i==j)    j++;

    }

    return (i<j)?i:j;

}

int main(){

    cin>>n;

    for(int i=;i<n;i++)    cin>>s[i];

    int l=Mini(n);

    cout<<l<<endl;

    return ;

}