func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long INF = 1e18;   long long prime[16] = {2,  3,  5,  7,  11, 13, 17, 19,                          23, 29, 31, 37, 41, 43, 47, 53};   long long n, ans;   void DFS(int x, int limit, long long num, long long cnt) {     if (cnt > n) return;     if (cnt == n && num < ans) ans = num;     for (int i = 1; i <= limit; i++) {       if (ans / prime[x] < num) break;       num *= prime[x];       DFS(x + 1, i, num, cnt * (i + 1));     }   }   int main() {     scanf( %lld , &n);     ans = INF;     DFS(0, 64, 1, 1);     printf( %lld n , ans);   }   