BEADS.cpp

#include <bits/stdc++.h>
#include <cstdio>
#define ll long
#define get(a) scanf("%ld", &a)
#define rep(n) for( ll i = 0; i < n; i++ )
#define repVector(v)  for(vector<int>::iterator it = v.begin(); it != v.end(); it++ )
#define repSet(s) for( set<ll>::iterator it = s.begin(); it != s.end(); it++ )
#define all(c) c.begin(), c.end()
#define repu(a,n) for( ll i = a; i < n; i++ )
#define pb push_back
#define min(a,b) ( (a < b) ? a : b )
#define max(a,b) ( (a > b) ? a : b )
#define absol(a) a >= 0 ? a : -a
#define FOR(i,a,b) for( ll i = a; i < b; i++ )
#define matrix vector< vector<ll> >
#define MOD 1000000007
#define L 2*r
#define R 2*r+1
using namespace std;

int main() {
	ll t;
	get(t);
	
	while(t--) {
		char str[10000+5];
		scanf("%s", &str);
		string s(str);
		string x = s + s;
		
		map<string,int> v;
		map<string,int>::iterator it;
		ll len = s.size();
		
		FOR(i,0,s.size()) {
			ll num = INT_MAX;
			it = v.find(x.substr(i,len));
			if( it != v.end() )
				num = it->second;
			v[x.substr(i,len)] = min( num, i+1 );
			//cout << x.substr(i,len) << "  " << 	v[x.substr(i,len)] << endl;
		}
		
		printf("%d\n", v.begin()->second);
		
	}
}