#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define FOR(i, l, r) for(int i = l; i <= r; i++)
#define REP(i, r, l) for(int i = r; i >= l; i--)
typedef long long ll;
double eps = 1e-6;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int f[5010];
int main()
{
    int T;
    scanf("%d",&T);
    
    while(T--)
    {
        int n;
        scanf("%d",&n);
        
        f[1] = 0;
        FOR(i,2,n)
            f[i] = (f[i-1] + n+1-i) %i;
        int ans = (1+ f[n] )%n;
        if(ans <=  0)
            ans+=n;
        printf("%d\n",ans);
        
    }
    return 0;
}