Problem: An agent called Cypher is decrypting a message, that contains a [composite number](https://en.wikipedia.org/wiki/Composite_number) n. All divisors of n, which are greater than 1, are placed in a circle. Cypher can choose the initial order of numbers in the circle.

In one move Cypher can choose two adjacent numbers in a circle and insert their [least common multiple](https://en.wikipedia.org/wiki/Least_common_multiple) between them. He can do that move as many times as needed.

A message is decrypted, if every two adjacent numbers are not coprime. Note that for such constraints it's always possible to decrypt the message.

Find the minimal number of moves that Cypher should do to decrypt the message, and show the initial order of numbers in the circle for that.

Input

The first line contains an integer t (1 ≤ t ≤ 100) — the number of test cases. Next t lines describe each test case.

In a single line of each test case description, there is a single composite number n (4 ≤ n ≤ 10^9) — the number from the message.

It's guaranteed that the total number of divisors of n for all test cases does not exceed 2 ⋅ 10^5.

Output

For each test case in the first line output the initial order of divisors, which are greater than 1, in the circle. In the second line output, the minimal number of moves needed to decrypt the message.

If there are different possible orders with a correct answer, print any of them.

Example

Input


3
6
4
30


Output


2 3 6 
1
2 4 
0
2 30 6 3 15 5 10 
0

Note

In the first test case 6 has three divisors, which are greater than 1: 2, 3, 6. Regardless of the initial order, numbers 2 and 3 are adjacent, so it's needed to place their least common multiple between them. After that the circle becomes 2, 6, 3, 6, and every two adjacent numbers are not coprime.

In the second test case 4 has two divisors greater than 1: 2, 4, and they are not coprime, so any initial order is correct, and it's not needed to place any least common multiples.

In the third test case all divisors of 30 greater than 1 can be placed in some order so that there are no two adjacent numbers that are coprime.

Solution (in JAVA):

Solution:
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class pb5 {
	static ArrayList<Factor> fs;
	static StringBuilder sb;
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int t = in.nextInt();
		for (int ti = 0; ti < t; ti++) {
			int n = in.nextInt();
			int sr = (int) Math.sqrt(n);
			fs = new ArrayList<>();
			int cnt = 0;
			while (n % 2 == 0) {
				cnt++;
				n /= 2;
			}
			if (cnt > 0) fs.add(new Factor(2, cnt));
			for (int i = 3; i <= sr; i+=2) {
				cnt = 0;
				while (n % i == 0) {
					cnt++;
					n /= i;
				}
				if (cnt > 0) fs.add(new Factor(i, cnt));
			}
			if (n > 1) fs.add(new Factor(n, 1));
			
			Collections.sort(fs);
			int fsz = fs.size();
			int need = -1;
			sb = new StringBuilder();
			if (fs.size() == 1) {
				int cf = fs.get(0).n;
				int cur = 1;
				for (int i = 1; i <= fs.get(0).c; i++) {
					cur *= cf;
					sb.append(cur).append(" ");
				}
				need = 0;
			} else if (fs.get(0).c == 1) { // no power more than 1
				if (fs.size() == 2) {
					need = 1;
					int f1 = fs.get(0).n, f2 = fs.get(1).n;
					sb.append(f1).append(" ").append(f2).append(" ").append(f1*f2);
				} else {
					need = 0;
					for (int i = 0; i < fsz-1; i++) {
						int cf = fs.get(i).n;
						sb.append(cf).append(" ");
						for (int j = i+2; j < (i == 0 ? fsz-1 : fsz); j++) {
							int nf = fs.get(j).n;
							sb.append(cf*nf).append(" ");
						}
						sb.append(cf*fs.get(i+1).n).append(" ");
					}
					sb.append(fs.get(fsz-1).n).append(" ").append(fs.get(fsz-1).n*fs.get(0).n).append(" ");
					fdfs(0, 1, 0);
				}
			} else {
				need = 0;
				for (int i = 0; i < fsz-1; i++) {
					Factor cff = fs.get(i);
					int cf = cff.n;
					sb.append(cf).append(" ");
					if (cff.c > 1) {
						sb.append(cf*cf).append(" ");
					}
					for (int j = i+2; j < (i == 0 ? fsz-1 : fsz); j++) {
						int nf = fs.get(j).n;
						sb.append(cf*nf).append(" ");
					}
					sb.append(cf*fs.get(i+1).n).append(" ");
				}
				Factor lf = fs.get(fsz-1);
				sb.append(lf.n).append(" ");
				if (lf.c > 1) sb.append(lf.n*lf.n).append(" ");
				if (fsz > 2) sb.append(fs.get(fsz-1).n*fs.get(0).n).append(" ");
				fdfs(0, 1, 0);
			}
			
			System.out.println(sb.toString().trim());
			System.out.println(need);
		}
		in.close();
	}
	
	static void fdfs(int i, int num, int cnt) {
		if (i >= fs.size()) {
			if (cnt >= 3) sb.append(num).append(" ");
			return;
		}
		fdfs(i+1, num, cnt);
		Factor cf = fs.get(i);
		for (int j = 1; j <= cf.c; j++) {
			num *= cf.n;
			fdfs(i+1, num, cnt+j);
		}
	}
	
	static class Factor implements Comparable<Factor> {
		int n, c;
		public Factor(int n, int c) {
			this.n = n;
			this.c = c;
		}
		@Override
		public int compareTo(Factor o) {
			return o.c-c;
		}
	}
}