func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 1000100;   int dp[N][2];   int a[] = {1, 2};   int solve(int sum, int idx) {     if (sum == 0) return 1;     if (sum < 0 || idx == 2) return 0;     if (dp[sum][idx] != -1) return dp[sum][idx];     return dp[sum][idx] = solve(sum - a[idx], idx) + solve(sum, idx + 1);   }   int main() {     int n;     scanf( %d , &n);     memset(dp, -1, sizeof(dp));     for (int i = 1; i < N; ++i) {       int ans = solve(i, 0);       if (ans == n) {         printf( %d 2 n1 2 , i);         break;       }     }     return 0;   }   