You are given an angle ang. 

The Jury asks You to find such regular n-gon (regular polygon with n vertices) that it has three vertices a, b and c (they can be non-consecutive) with \angle{abc} = ang or report that there is no such n-gon.

<image>

If there are several answers, print the minimal one. It is guarantied that if answer exists then it doesn't exceed 998244353.

Input

The first line contains single integer T (1 ≤ T ≤ 180) — the number of queries. 

Each of the next T lines contains one integer ang (1 ≤ ang < 180) — the angle measured in degrees. 

Output

For each query print single integer n (3 ≤ n ≤ 998244353) — minimal possible number of vertices in the regular n-gon or -1 if there is no such n.

Example

Input


4
54
50
2
178


Output


10
18
90
180

Note

The answer for the first query is on the picture above.

The answer for the second query is reached on a regular 18-gon. For example, \angle{v_2 v_1 v_6} = 50^{\circ}.

The example angle for the third query is \angle{v_{11} v_{10} v_{12}} = 2^{\circ}.

In the fourth query, minimal possible n is 180 (not 90).


import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.nio.charset.StandardCharsets;
import java.util.regex.*;

public class PolygonAngle {

    public static void main(String[] args) {
        try {
            //Scanner sc = new Scanner(System.in);
            BufferedInputStream bf = new BufferedInputStream(System.in);
            BufferedReader in = new BufferedReader(
                    new InputStreamReader(bf, StandardCharsets.UTF_8));
            OutputStream out = new BufferedOutputStream ( System.out );
            int t = Integer.parseInt(in.readLine());
            while(t-->0){
                int ang = Integer.parseInt(in.readLine());
                int g = gcd(180,ang);
                int i=2;
                int n = 180/g, k = ang/g;
                while(k>n-2){
                    n *= i;
                    k *= i;
                    i++;
                }
                System.out.println(n);
            }
            
            
        }catch(Exception ex){
            ex.printStackTrace();
        }
    }
    
    static int gcd(int a,int b){
        return b==0 ? a : gcd(b,a%b);
    }
}
