#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 1200005 int a[MAX_N]; int main() { a[4] = 1; srep(i,5,MAX_N){ a[i] = a[i-1] + a[i-2] + a[i-3] + a[i-4]; a[i] %= 17; } int T; cin >> T; rep(_,T){ int n; cin >> n; cout << a[n] << endl; } return 0; }