#include <iostream> #include <vector> #include <string> #include <algorithm> #include <utility> #include <stack> #include <functional> #include <queue> #include <cmath> #include <set> #include <map> #include <numeric> #define rep(i,j,k) for(int i=(int)j;i<(int)k;i++) #define Sort(x) sort((x).begin(),(x).end()) #define all(x) (x).begin(),(x).end() #define fi first #define se second #define vi vector<int> #define INF (int)1e9 #define INFL 1e18 #define MOD 1000000007 #define pb push_back #define MP make_pair typedef long long int ll; typedef std::pair<int,int> P; int D=1; int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0}; using namespace std; int main(){ int v[1000010]; v[0]=0; v[1]=0; v[2]=0; v[3]=1; rep(i,4,1000001){ v[i]=v[i-1]+v[i-2]+v[i-3]+v[i-4]; v[i]%=17; } int n; cin>>n; rep(i,0,n){ int x; cin>>x; cout<<v[x-1]<<endl; } return 0; }