/*

@theme:hdu1248 寒冰王座

@writer:pprp

@begin:16:00

@end:16:14

@declare:完全背包问题

@error:方向问题，这次是从左向右进行扫描

@date:2017/9/3

*/

#include <bits/stdc++.h>

using namespace std;

const int maxn = ;

int dp[maxn];

int w[] = {,,,};

int N;

int main()

{

    //freopen("in.txt","r",stdin);

    int cas;

    cin >> cas;

    while(cas--)

    {

        memset(dp,,sizeof(dp));

        cin >> N;

        for(int i = ; i <=  ; i++)

        {

            for(int j =  ; j <= N; j++)//error

            {

                if(j >= w[i])//error

                dp[j] = max(dp[j],dp[j-w[i]] + w[i]);

            }

        }

        cout << N - dp[N] << endl;

    }

    return ;

}