You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the following game to warm up: initially a piece of paper has an integer *q*. During a move a player should write any integer number that is a non-trivial divisor of the last written number. Then he should run this number of circles around the hotel. Let us remind you that a number's divisor is called non-trivial if it is different from one and from the divided number itself. 

The first person who can't make a move wins as he continues to lie in his warm bed under three blankets while the other one keeps running. Determine which player wins considering that both players play optimally. If the first player wins, print any winning first move.
The first line contains the only integer *q* (1 ≤ *q* ≤ 10<sup class="upper-index">13</sup>).

Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.
6
2
30
1
6
1
1
0
2
1
0
3
1
0
5
1
0
445538663413
1
0
5138168457911
2
472670214391
1
23020027
1468526771489
1
613783
1307514188557
1
39283
8110708459517
2
7938986881993
1
378028993
34280152201
2
8587340257
1
9409
1245373417369
1
908209
48855707
1
18769
614125
1
25
1716443237161
1
5329
49380563
1
289
2975
1
25
5839252225
1
25
266418
1
9
319757451841
1
289
3047527844089
2
1408514752349
1
72361
9999925100701
1
0
9999926826034
2
6599669076000
1
4
324
1
4
99
1
9
4
2
8
1
4
1000000000000
1
4
9
2
50
1
25
16
1
4
25
2
44
1
4
388
1
4
2000000014
2
128
1
4
27
1
9
274875809788
1
4
64
1
4
802241960524
1
4
401120980262
2
236
1
4
7420738134810
1
6
12
1
4
57461344602
1
6
81
1
9
30971726
2
class CodeforcesTask150ASolution:
    def __init__(self):
        self.result = ''
        self.q = 0

    def read_input(self):
        self.q = int(input())

    def process_task(self):
        moving = 1
        number = self.q
        x = number - 1
        move = 0
        while x > 1:
            if not number % x:
                if moving == 1:
                    moving = 2
                    move = x
                else:
                    moving = 1
                number = x
                x = number - 1
            else:
                x -= 1
        #print(moving, move, number)
        if moving == 1:
            self.result = "{0}\n{1}".format(moving, move)
        else:
            self.result = "2"

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask150ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
