1716A - 2-3 Moves.cpp

/** ========================================**
 ** @Author: Kareem Taha Abdelfatah
 ** @Category: Codeforces problems solutions
/** ========================================**/
 
#include<bits/stdc++.h>
using namespace std;
#define IO                  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define endll               "\n"
#define ll                  long long
#define fr(i, n)            for(ll i = 0; i < n; i++)
#define fr1(i, n)           for(ll i = 1; i <= n; i++)
#define asort(a)            sort(a + 1, a + n + 1)
#define dsort(a)            sort(a + 1, a + n + 1, greater<int>())
const long long N = 2e5 + 5, MOD = 1e9 + 7, oo = 1e18;
const double PI = 3.14;
const double Prox = 1e-7;
 
ll a[N], b[N] ,q[N], s[N], w[N], xy[N], l, r, v, x, y, j;
string a1[N], b1[N];
map<ll, ll>mp, mk;
set<ll>st;
pair<int, int> arr[N];
 
struct point{
    int x;
    int y;
};
 
// true (not swap).
// false (swap).
bool cmp(point a, point b){
    if(a.x == b.x){
        return a.y < b.y;
    }
    else return a.x < b.x;
};
 
 
int main()
{
    IO
    int Tc; cin >> Tc;
    while(Tc--){
        ll n, ans = 0, moves = 0; cin >> n;
        if(n == 1) cout << 2 << endll;
        else if(n == 2) cout << 1 << endll;
        else{
            if(n % 3 == 1 || n % 3 == 2){
                ans = n / 3;
                ans++;
            }
            else if(n % 3 == 0) ans = n / 3;
            cout << ans << endll;
        }
    }
    return 0;
}