在n个银币中有一个是不合格的，不合格的银币比合格银币要轻。

现用天平秤银币，找出不合格的银币，且在最坏情况下秤银币的次数最少。

输入

输入有若干行。每行上有一个整数n，表示银币个数，n<100000。

当n=0，表示输入结束。

输出

对输入大于0的整数n，输出2行。第1行输出n的值，第2行上先输出“Times:”，接着输出在最坏情况下秤n个银币的最少次数。

当n=0时，这种情况你不必处理和结果输出。

-In n pieces of silver in one unqualified, unqualified than qualified coin silver lighter. Silver with the balance scale is to identify unqualified silver, and silver in the worst case the number of scales at least. Enter the input number line. Each line has an integer n, said the number of silver coins, n < 100000. When n = 0, the input end. The output of the input integer greater than 0 n, the output line 2. Line 1 output value of n, 2 line outputs the " Times:" , then the output scale n in the worst case minimum number of pieces of silver. When n = 0 when you do not have to deal with this situation and results output.