func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long INF = 1e18;   const int N = 1e5 + 10, INFI = 1e9 + 10;   int val[12];   unordered_set<int> s;   int main() {     cin.tie(NULL);     cout.tie(NULL);     ios_base::sync_with_stdio(false);     int n;     cin >> n;     for (int i = 0; i < 12; i++) {       s.clear();       for (int a = 0; a <= i + 1; a++) {         for (int b = 0; b <= i + 1 - a; b++) {           for (int c = 0; c <= i + 1 - a - b; c++) {             for (int d = 0; d <= i + 1 - a - b - c; d++) {               if (a + b + c + d == i + 1) {                 s.insert((a * 1) + (b * 5) + (c * 10) + (d * 50));               }             }           }         }       }       val[i] = s.size();     }     if (n <= 12) {       cout << val[n - 1] << endl;     } else {       cout << val[11] + 1LL * 49 * (n - 12) << endl;     }     return 0;   }   