#719Glass Beads

★★★

時間限制：2000 毫秒記憶體限制：64 MB

Once upon a time there was a famous actress. As you may expect, she played mostly Antique Comedies most of all. All the people loved her. But she was not interested in the crowds. Her big hobby were beads of any kind. Many bead makers were working for her and they manufactured new necklaces and bracelets every day. One day she called her main Inspector of Bead Makers (IBM) and told him she wanted a very long and special necklace.

The necklace should be made of glass beads of different sizes connected to each other but without any thread running through the beads, so that means the beads can be disconnected at any point. The actress chose the succession of beads she wants to have and the IBM promised to make the necklace. But then he realized a problem. The joint between two neighbouring beads is not very robust so it is possible that the necklace will get torn by its own weight. The situation becomes even worse when the necklace is disjoined. Moreover, the point of disconnection is very important. If there are small beads at the beginning, the possibility of tearing is much higher than if there were large beads. IBM wants to test the robustness of a necklace so he needs a program that will be able to determine the worst possible point of disjoining the beads.

The description of the necklace is a string A = aa . . . a specifying sizes of the particular beads, where the last character a is considered to precede character a in circular fashion.

範例輸入 1

4
helloworld
amandamanda
dontcallmebfu
aaabaaa

範例輸出 1

Pro 專屬功能：查看這題在歷屆 CPE 出現過幾次 — 升級以解鎖.

₁

₂

₁

The disjoint point i is said to be worse than the disjoint point j if and only if the string a_ia_i+1 . . . a_na₁ . . . a_i-1 is lexicografically smaller than the string a_ja_j+1 . . . a_na₁ . . . a_j-1. String a₁a₂ . . . a_n is lexicografically smaller than the string b₁b₂ . . . b_n if and only if there exists an integer i, i ≤ n, so that a_j = b_j, for each j, 1 ≤ j < i and a_i < b_i.

Input

The input consists of N cases. The first line of the input contains only positive integer N . Then follow the cases. Each case consists of exactly one line containing necklace description. Maximal length of each description is 10000 characters. Each bead is represented by a lower-case character of the english alphabet (a–z), where a < b < ... < z.

Output

For each case, print exactly one line containing only one integer — number of the bead which is the first at the worst possible disjoining, i.e. such i, that the string A[i] is lexicographically smallest among all the n possible disjoinings of a necklace. If there are more than one solution, print the one with the lowest i.