CODE: #include <bits/stdc++.h> #include #include <math.h> #include #include <stdio.h> using namespace std; typedef long long ll; const int N = 1005; ll t, n, f[N];

int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t; while (t--) { memset(f, 0, sizeof(f)); cin >> n; f[0] = 0; f[1] = 1; f[2] = 2; for (int i = 3; i <= n; i++) { f[i] = f[i - 1] + f[i - 2]; } cout << f[n] << endl; } return 0; }