#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) { cout << '\n'; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  string s = typeid(a).name();
  cout << "[" << *it << " = ";
  cout << a;
  cout << "] ";
  err(++it, args...);
}
void catchAlarm(int sig) {
  cout << "TL!!!!!";
  exit(0);
}
void assertTL(bool stat) {
  while (!stat) {
  }
}
void assertML(bool stat) {
  vector<long long> v;
  while (!stat) {
    v.push_back(1);
  }
}
int gcd(int a, int b) {
  if (a < b) swap(a, b);
  return b ? gcd(b, a % b) : a;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  return b ? gcd(b, a % b) : a;
}
pair<int, int> dx2[] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
pair<int, int> dx[] = {{0, -1}, {-1, 0}, {0, 1}, {1, 0}};
int inf = 2e9 + 7;
long long INF = 1e18 + 7;
double eps = 1e-7;
int mod = 1e9 + 7;
int mod2 = 1000010029;
int BASE = 1000117;
int base = 29;
long long MOD = 1e15 + 7;
mt19937 lol(chrono::steady_clock::now().time_since_epoch().count());
void Max(int &a, int b) {
  if (b > a) a = b;
}
void Min(int &a, int b) {
  if (b < a) a = b;
}
void Max(long long &a, long long b) {
  if (b > a) a = b;
}
void Min(long long &a, long long b) {
  if (b < a) a = b;
}
void Add(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
void Sub(int &a, int b) {
  a -= b;
  if (a < 0) a += mod;
}
int add(int a, int b) {
  a += b;
  if (a >= mod) a -= mod;
  return a;
}
int sub(int a, int b) {
  a -= b;
  if (a < 0) a += mod;
  return a;
}
int mul(int a, int b) { return a * 1ll * b % mod; }
int bp(int a, int n, int mOd = mod) {
  if (n == 0) return 1;
  int res = bp(a, n / 2, mOd);
  res = res * 1ll * res % mOd;
  if (n & 1) res = res * 1ll * a % mOd;
  return res;
}
const int time_limit = 5;
const bool multiple_tests = 1;
const int N = 5e3 + 77;
int n, a[5005][13];
void solve() { cout << 1; }
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string file_name = "test";
  int TT = 1;
  if (multiple_tests) cin >> TT;
  for (int testcase = 1; testcase <= TT; testcase++) {
    solve();
    cout << '\n';
  }
  return 0;
}
