from math import gcd
for _ in range(int(input())):
theta = int(input())
g = gcd(theta, 180)
n_min = 180//g
assert (n_min * theta)%180 == 0
k = (n_min * theta)//180
print(n_min + (n_min)*(k == n_min - 1))/*
Problem: 1096C
Date: 06-01-2024 03:39 AM
*/
#include <iostream>
#include <algorithm>
#define M 998244353
using namespace std;
int T;
int n;
int main() {
cin >> T;
for(int k = 0; k < T; k++) {
cin >> n;
for(long long i = 3; i <= 360; i++) {
if((i * (i - 2) * n) % (180 * i - 360) == 0 && n * i * (i - 2) / (180 * i - 360) <= i - 2) {
cout << i << endl;
break;
}
}
}
}151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |
734A - Anton and Danik | 1300B - Assigning to Classes |
1647A - Madoka and Math Dad | 710A - King Moves |
1131A - Sea Battle | 118A - String Task |
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |
479C - Exams | 1030A - In Search of an Easy Problem |
158A - Next Round | 71A - Way Too Long Words |
160A - Twins | 1A - Theatre Square |
1614B - Divan and a New Project | 791A - Bear and Big Brother |