#include < bits/stdc++.h >
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 1e5 + 5;

int32_t main()
{
	IOS;
	int t;
	cin >> t;
	while(t--)
	{
		int n;
		cin >> n;
		cout << n / 2 << endl;
	}
	return 0;
}

#include < bits/stdc++.h >
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 2e5 + 5;

int n;
int a[N];

int32_t main()
{
	IOS;
	int t;
	cin >> t;
	while(t--)
	{
		cin >> n;
		vector< int > even, odd;
		for(int i = 1; i <= 2 * n; i++)
		{
			cin >> a[i];
			if(a[i] % 2)
				odd.push_back(i);
			else
				even.push_back(i);
		}
		vector< pair< int, int > > ans;
		for(int i = 0; i + 1 < odd.size(); i += 2)
			ans.push_back({odd[i], odd[i + 1]});
		for(int i = 0; i + 1 < even.size(); i += 2)
			ans.push_back({even[i], even[i + 1]});
		for(int i = 0; i < n - 1; i++)
			cout << ans[i].first << " " << ans[i].second << endl;
	}
	return 0;
}

#include< bits/stdc++.h >
using namespace std;

const int N = 50000;

void player_1(){
	cout << "Ashishgup" << endl;
}

void player_2(){
	cout << "FastestFinger" << endl;
}

bool check_prime(int n){
	for(int i = 2; i < min(N, n); i++)
		if(n % i == 0)
			return 0;
	return 1;
}

int main(){
	int tc;
	cin >> tc;
	while(tc--){
		int n;
		cin >> n;
		bool lose = (n == 1);
		if(n > 2 && n % 2 == 0){
			if((n & (n — 1)) == 0)
				lose = 1;
			else if(n % 4 != 0 && check_prime(n / 2))
				lose = 1;
		}
		if(lose)
			player_2();
		else player_1();
	}
}

#include < bits/stdc++.h >
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 2e5 + 5;

int n, k;
int a[N];

bool check(int x, int cur)
{
	int ans = 0;
	for(int i = 1; i <= n; i++)
	{
		if(!cur)
		{
			ans++;
			cur ^= 1;
		}
		else
		{
			if(a[i] <= x)
			{
				ans++;
				cur ^= 1;
			}
		}
	}
	return ans >= k;
}

int binsearch(int lo, int hi)
{
	while(lo < hi)
	{
		int mid = (lo + hi) / 2;
		if(check(mid, 0) || check(mid, 1))
			hi = mid;
		else
			lo = mid + 1;
	}
	return lo;
}

int32_t main()
{
	IOS;
	cin >> n >> k;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	int ans = binsearch(1, 1e9);
	cout << ans;
	return 0;
}

#include < bits/stdc++.h >
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 1e6 + 5;

int n;
string s, t;
int a[N];

int get(int x)
{
	int cur = 0, mx = 0;
	for(int i = 1; i <= n; i++)
	{
		cur += x * a[i];
		mx = max(mx, cur);
		if(cur < 0)
			cur = 0;
	}
	return mx;
}

int32_t main()
{
	IOS;
	cin >> n >> s >> t;
	int sum = 0;
	for(int i = 1; i <= n; i++)
	{
		if(s[i - 1] != t[i - 1])
		{
			if(s[i - 1] == '1')
				a[i] = -1;
			else
				a[i] = 1;
		}
		sum += a[i];
	}
	if(sum != 0)
	{
		cout << -1;
		return 0;
	}
	int ans = max(get(1), get(-1));
	cout << ans;
	return 0;
}

#include< bits/stdc++.h >
using namespace std;

const int N = 1001;

vector< int > adj[N], depth(N), max_depth(N);

int n, root, dist;

void dfs(int i, int par){
	max_depth[i] = depth[i];
	for(int j : adj[i]){
		if(j == par)
			continue;
		depth[j] = 1 + depth[i], dfs(j, i);
		max_depth[i] = max(max_depth[i], max_depth[j]);
	}
}

void find_nodes(int i, int par, int req_depth, vector< int > &nodes){
	if(depth[i] == req_depth){
		nodes.push_back(i);
		return;
	}
	for(int j : adj[i])
		if(j != par && max_depth[j] <= n / 2)
			find_nodes(j, i, req_depth, nodes);
}

pair query(vector< int > nodes){
	cout << "? " << nodes.size() << ' ';
	for(int i : nodes)
		cout << i << ' ';
	cout << endl;
	fflush(stdout);

	int x, dist;
	cin >> x >> dist;

	return {x, dist};
}

int main(){
	int t;
	cin >> t;
	while(t--){
		cin >> n;

		for(int i = 1; i <= n; i++)
			adj[i].clear(), depth[i] = 0, max_depth[i] = 0;

		for(int i = 1; i < n; i++){
			int u, v;
			cin >> u >> v;
			adj[u].push_back(v);
			adj[v].push_back(u);
		}

		vector< int > nodes;
		for(int i = 1; i <= n; i++)
			nodes.push_back(i);

		pair< int, int > res = query(nodes);
		root = res.first, dist = res.second;

		dfs(root, 0);

		int st = 0, en = n / 2, first_node = root;
		while(st <= en){
			int mid = st + en >> 1;

			vector< int > node_set;
			find_nodes(root, 0, mid, node_set);

			if(node_set.empty())
				en = mid — 1;
			else{
				pair< int, int > res = query(node_set);
				if(res.second == dist)
					first_node = res.first, st = mid + 1;
				else en = mid — 1;
			}
		}
		vector< int > candidate_second;
		queue< pair< int, int > > q;
		vector< int > vis(n + 1);
		q.push({first_node, 0});
		while(!q.empty()){
			pair< int, int > node = q.front();
			q.pop();
			vis[node.first] = 1;
			if(node.second == dist)
				candidate_second.push_back(node.first);

			for(int j : adj[node.first])
				if(!vis[j])
					vis[j] = 1, q.push({j, node.second + 1});
		}
		pair< int, int > second_node = query(candidate_second);
		cout << "! " << first_node << ' ' << second_node.first << endl;

		string correct;
		cin >> correct;
	}
}

#include 
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 51;

int n, m;
int a[N][N];

int32_t main()
{
	IOS;
	int t;
	cin >> t;
	while(t--)
	{
		cin >> n >> m;
		set< int > r, c;
		for(int i = 1; i <= n; i++)
		{
			for(int j = 1; j <= m; j++)
			{
				cin >> a[i][j];
				if(a[i][j] == 1)
					r.insert(i), c.insert(j);
			}
		}
		int mn = min(n — r.size(), m — c.size());
		if(mn % 2)
			cout << "Ashish" << endl;
		else
			cout << "Vivek" << endl;
	}
	return 0;
}

#include 
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 1e3 + 5;

int n;
int a[N], b[N];

int32_t main()
{
	IOS;
	int t;
	cin >> t;
	while(t--)
	{
		cin >> n;
		bool sorted = 1, have0 = 0, have1 = 0;
		for(int i = 1; i <= n; i++)
		{
			cin >> a[i];
			if(i >= 2 && a[i] < a[i - 1])
				sorted = 0;
		}
		for(int i = 1; i <= n; i++)
		{
			cin >> b[i];
			if(!b[i])
				have0 = 1;
			else
				have1 = 1;
		}
		if(have0 && have1)
			cout << "Yes" << endl;
		else if(sorted)
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
	return 0;
}

#include 
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 2e5 + 5;

int n;
int a[N], b[N], pos[N];
map< int, int > offset;

int32_t main()
{
	IOS;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
		pos[a[i]] = i;
	}
	for(int i = 1; i <= n; i++)
		cin >> b[i];
	for(int i = 1; i <= n; i++)
	{
		int cur = pos[b[i]] - i;
		if(cur < 0)
			cur += n;
		offset[cur]++;
	}
	int ans = 0;
	for(auto &it:offset)
		ans = max(ans, it.second);
	cout << ans;
	return 0;
}

#include 
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 55;
char en = '\n';
ll inf = 1e16;
ll mod = 1e9 + 7;
ll power(ll x, ll n, ll mod) {
  ll res = 1;
  x %= mod;
  while (n) {
    if (n & 1)
      res = (res * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return res;
}
ll n, m;
char arr[N][N];
ll dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

bool valid(ll i, ll j) { return i >= 1 && i <= n && j >= 1 && j <= m; }
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  ll t;
  cin >> t;
  while (t--) {

    cin >> n >> m;

    for (ll i = 1; i <= n; i++) {
      cin >> (arr[i] + 1);
    }

    for (ll i = 1; i <= n; i++) {
      for (ll j = 1; j <= m; j++) {
        if (arr[i][j] == 'B') {
          for (ll k = 0; k < 4; k++) {
            ll ni = i + dir[k][0];
            ll nj = j + dir[k][1];
            if (valid(ni, nj) && arr[ni][nj] == '.')
              arr[ni][nj] = '#';
          }
        }
      }
    }

    queue> que;
    bool visited[n + 5][m + 5];
    memset(visited, false, sizeof(visited));
    if (arr[n][m] == '.') {
      que.push({n, m});
      visited[n][m] = true;
    }
    while (!que.empty()) {
      pair curr = que.front();
      que.pop();
      for (ll k = 0; k < 4; k++) {
        ll ni = curr.first + dir[k][0];
        ll nj = curr.second + dir[k][1];
        if (valid(ni, nj) && !visited[ni][nj] && arr[ni][nj] != '#') {
          que.push({ni, nj});
          visited[ni][nj] = true;
        }
      }
    }
    bool good = true;
    for (ll i = 1; i <= n; i++) {
      for (ll j = 1; j <= m; j++) {
        if ((arr[i][j] == 'G' && !visited[i][j]) or
            (arr[i][j] == 'B' && visited[i][j])) {
          good = false;
          break;
        }
      }
    }
    cout << (good ? "Yes" : "No") << en;
  }

  return 0;
}

#include 
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 505;

int n;
int a[N];

int32_t main()
{
	IOS;
	cin >> n;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	int ans = 0;
	for(int i = 1; i <= n; i++)
		for(int j = i; j <= n; j++)
			for(int k = j; k <= n; k++)
				ans = max(ans, (a[i] | a[j] | a[k]));
	cout << ans;
	return 0;
}

#include
using namespace std;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int tc;
	cin >> tc;
	while(tc--){
		int n;
		cin >> n;
		map< pair < int, int >, int > pairs;
		vector< int > a(n), b(n);
		bool possible = 1;

		for(int i = 0; i < n; i++)
			cin >> a[i];

		for(int i = 0; i < n; i++)
			cin >> b[i];

		if(n % 2 == 1 && a[n / 2] != b[n / 2])
			possible = 0;

		for(int i = 0; i < n / 2; i++){
			pair< int, int > p = {min(a[i], a[n — 1 — i]), max(a[i], a[n — 1 — i])};
			pairs[p]++;
		}

		for(int i = 0; i < n / 2; i++){
			pair< int, int > p = {min(b[i], b[n — 1 — i]), max(b[i], b[n — 1 — i])};
			if(pairs[p] <= 0)
				possible = 0;
			pairs[p]--;
		}

		if(possible)
			cout << "Yes" << endl;

		else cout << "No" << endl;
	}
}

#include
using namespace std;

#define ll long long
#define vint vector< int >

const int Q = 13;

ll query(vint v){
	cout << "? " << v.size() << ' ';
	for(ll i : v)
		cout << i + 1 << ' ';
	cout << endl;
	fflush(stdout);
	ll or_value;
	cin >> or_value;
	return or_value;
}

int main(){
	int n;
	cin >> n;

	vector< vint > ask(Q);
	vint assign_mask(n);

	vector< ll > or_value(Q), answer(n);

	int assigned = 0;

	for(int i = 1; i < (1 << Q); i++){
		if(__builtin_popcount(i) != Q / 2)
			continue;
		assign_mask[assigned] = i;
		for(int j = 0; j < Q; j++)
			if((i >> j & 1) == 0)
				ask[j].push_back(assigned);
		assigned++;
		if(assigned == n)
			break;
	}

	for(int i = 0; i < Q; i++)
		if(!ask[i].empty())
			or_value[i] = query(ask[i]);

	for(int i = 0; i < n; i++)
		for(int j = 0; j < Q; j++)
			if(assign_mask[i] >> j & 1)
				answer[i] |= or_value[j];

	cout << "! ";

	for(ll i : answer)
		cout << i << ' ';

	cout << endl;
}