#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;

//int n,m,l[1010],r[1010],b[4010],dp[1010][4010];

int main(){
    for( int T ; scanf( "%d" , &T )==1 ; ){
        for( int cas=1 ; cas<=T ; cas++  ){
            ll n; scanf( "%I64d" , &n );
            if( n<=2 ){
                printf( "1\n" );
            }else{
                n-=2;
                ll m = (n-1)/6;
                ll p = (n-1)%6+1;
                if( p==1 ){
                    printf( "%I64d\n" , m );
                }else if( p==2 ){
                    printf( "%I64d\n" , 6*m+3 );
                }else if( p==3 ){
                    printf( "%I64d\n" , m );
                }else if( p==4 ){
                    printf( "%I64d\n" , 3*m+3 );
                }else if( p==5 ){
                    printf( "%I64d\n" , 4*m+5 );
                }else if( p==6 ){
                    printf( "%I64d\n" , 3*m+4 );
                }
            }
            /*
            scanf( "%d" , &n );
            m = 0;
            for( int i=1 ; i<=n ; i++ ){
                scanf( "%d%d" , &l[i] , &r[i] );
                b[++m] = l[i];
                b[++m] = r[i];
                if(l[i]<r[i]){
                    b[++m] = l[i]+1;
                    b[++m] = r[i]-1;
                }
            }
            sort( b+1 , b+m+1 );
            m = unique( b+1 , b+m+1 )-b-1;
            for( int i=1 ; i<=n ; i++ ){
                l[i] = lower_bound( b+1 , b+m+1 , l[i] )-b;
                r[i] = lower_bound( b+1 , b+m+1 , r[i] )-b;
            }
            for( int i=1 ; i<=m ; i++ ) dp[0][i] = 0;
            for( int i=1 ; i<=n ; i++ ){
                for( int j=l[i] ; j<=r[i] ; j++ )
                    dp[i][j] = dp[i-1][j];
                for( int j=1 ; j<=l[i] ; j++ )
                    dp[i][j] = min( dp[i-1][l[i]]+(b[l[i]]-b[j]+1)/2 , dp[i-1][j]+(b[l[i]]-b[j]+1)/2*2 );
                for( int j=r[i] ; j<=m ; j++ )
                    dp[i][j] = min( dp[i-1][r[i]]+(b[j]-b[r[i]]+1)/2 , dp[i-1][j]+(b[j]-b[r[i]]+1)/2*2 );
            }
            int ans = inf;
            for( int i=1 ; i<=m ; i++ )
                ans = min( ans , dp[n][i] );
            printf( "%d\n" , ans );
            */
        }
    }
    return 0;
}