The_Tom_and_Jerry_Game.cpp

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll mod = 1000000007;
const ll inf = 1e18;
#define all(x) begin(x), end(x)
#define loop(i, n) for (int i = 0; i < n; i++)
#define print_array(arr)                                         \
    loop(z, sizeof(arr) / sizeof(arr[0])) cout << arr[z] << " "; \
    cout << "\n"
#define print_vector(vvv)                      \
    loop(z, vvv.size()) cout << vvv[z] << " "; \
    cout << "\n"
#define print_vector_pair(vvv)                                             \
    loop(z, vvv.size()) cout << vvv[z].first << " " vvv[z].second << "\n"; \
    cout << "\n"
#define fill_my(arr, q) fill(all(arr), q)

void solve()
{
    ll n;
    cin >> n;
    ll count = 0;

    if (log2(n) == (int)(log2(n)) || n == 1 || n==2)
    {
        count = 0;
    }
    else if (n % 2 == 1)
    {
        count = n / 2;
    }
    else if (n % 2 == 0)
    {
        ll temp = n;
        ll powS = 0;
        while (temp % 2 == 0)
        {
            temp /= 2;
            powS++;
        }
        ll t=pow(2, powS + 1);
        if (t<n)
        {
            count=(ll)(n/t);
        }
        
    }
    cout << count << endl;

    // for (int i = 0; i < n; i++)
    // {
    // }
    // //cout <<a<<"\n";
}

int main()
{
    clock_t time_req;
    time_req = clock();
    cin.sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }

    // time_req = clock() - time_req;
    // cout << "\nProcessor time " << (float)time_req / CLOCKS_PER_SEC<< " sec" << endl;
    return 0;
}