34459번 - MIT Time 다국어

문제

Busy Beaver arrived to his MIT class late! However, thanks to "MIT time", all classes actually start 5ドル$ minutes later than the posted time.

Busy Beaver wants to make a generalization of this system. Namely, if someone arrives $N$ minutes late to an event, then:

• if $N \le 5,ドル they arrived on "MIT time";
• if 5ドル < N \le 25,ドル they arrived on "MIT$^2$ time";
• if 25ドル < N \le 125,ドル they arrived on "MIT$^3$ time";
• and so on. Formally, if $k \ge 2,ドル then "MIT$^k$ time" is when 5ドル^{k-1} < N \le 5^k$.

Given $N,ドル determine on which of "MIT time", "MIT$^2$ time", etc. this person arrived at.

입력

The first line contains a single integer $T$ $(1 \leq T \leq 10^5)$ --- the number of test cases.

The only line of each test case contains a single integer $N$ (1ドル \le N \le 10^9$) --- the number of minutes late to an event the person is.

출력

For each test case, output a single line that consists of either "MIT time" or "MIT^$k$ time" for some integer $k \geq 2,ドル corresponding to the time this person arrives at.

제한

노트

In the first test case, $N = 4,ドル which is at most 5ドル,ドル so this is MIT time.

In the second test case, $N = 5,ドル which is equal to 5ドル,ドル so this is also MIT time.

In the third test case, $N = 13,ドル which is not more than 25ドル$ but more than 5ドル,ドル so this is MIT$^2$ time.

The fourth test case, $N = 126,ドル which is not more than 5ドル^4=625$ but more than 5ドル^3 = 125,ドル so this is MIT$^4$ time.