#include <bits/stdc++.h>
using namespace std;
template <class T, class T2>
inline int chkmax(T &x, const T2 &y) {
  return x < y ? x = y, 1 : 0;
}
template <class T, class T2>
inline int chkmin(T &x, const T2 &y) {
  return x > y ? x = y, 1 : 0;
}
const int MAXN = (1 << 20);
const double eps = 1e-6;
int answer[200];
int n;
void read() { cin >> n; }
void solve() { cout << answer[n] << '\n'; }
int closest(double x) { return (int)(x + 0.5); }
void work(int l) {
  double ang = 180 * (l - 2) / (double)l;
  double hlf = (180 - ang) / 2.0;
  double sum = 0;
  for (int j = 1; j <= l - 2; j++) {
    sum += hlf;
    int v = closest(sum);
    if (fabs(v - sum) < eps && answer[v] == -1) answer[v] = l;
  }
}
void prepare() {
  for (int l = 2; l <= 10000; l++) work(l);
}
int main() {
  memset(answer, -1, sizeof(answer));
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  prepare();
  int T;
  cin >> T;
  while (T--) {
    read();
    solve();
  }
  return 0;
}
