#include <iostream> using namespace std; const int mod = 32767; const int maxn = 1e6 + 5; int a[maxn]; int main() { a[1] = 1; a[2] = 2; for (int i = 3; i <= 1e6; i ++) {//计算10^6个数 a[i] = ((2 * a[i - 1] % mod) + (a[i - 2] % mod)) % mod; } int n, k; cin >> n; while (n --) { cin >> k; cout << a[k] << endl;//直接回答第k个值，不需要每次都去循环求解 } return 0; }