Kenny's love for Pizza kept increasing day by day. After completing his Pizza-Tech degree he made amazing breakthrough in Pizza industry, one of them was The Tree of Pizza.

The Tree of Pizza is the same as a full binary tree with each node as a slice of pizza. The tree has infinite depth, yes! infinite amount of Pizza ! Following the properties of full binary tree, each pizza node will have exactly two pizza children. Moreover there are just two flavors of pizza : Veggie Supreme and Cheese Margarita.

The Pizza nodes are numbered in this manner:

Given a Pizza node numbered N, if the number of divisors of N is strictly greater than $[sqrt(N)]$ then the node has Veggie Supreme otherwise Cheese Margarita.

Your task is to find out for a given value of N, what is the depth of the node numbered N (root has 1 depth) and what flavor of pizza it contains.

Input:

The first line of input contains an integer T denoting the number of test cases.

Each line of test case contains a single integer N denoting the pizza node number.

Output:

For each test case, in a new line, print the flavor of pizza followed by the depth of given pizza node.

Constraints:

$1\le T \le 10^{6}$

$1\le N \le 10^{7}$