func_code_string: #include <bits/stdc++.h>   using namespace std;   inline bool isPrime(uint64_t n) {     if (n == 1) return false;     if (n == 2) return true;     if (n % 2 == 0) return false;     for (uint64_t div = 3; div * div <= n; div += 2)       if (n % div == 0) return false;     return true;   }   inline std::vector<uint64_t> generatePrimesUntil(uint64_t upperBound) {     if (upperBound < 2) return {};     std::vector<uint64_t> result = {2};     for (uint64_t candidate = 3; candidate <= upperBound; candidate += 2) {       bool divisibleByPrevious = false;       for (size_t divisorIndex = 1;            divisorIndex < result.size() &&            result[divisorIndex] * result[divisorIndex] <= candidate;            ++divisorIndex) {         if (candidate % result[divisorIndex] == 0) {           divisibleByPrevious = true;           break;         }       }       if (!divisibleByPrevious) result.push_back(candidate);     }     return result;   }   inline std::vector<std::pair<uint64_t, uint64_t>> decomposeToPrimePowers(       uint64_t n) {     std::vector<std::pair<uint64_t, uint64_t>> result;     auto tryPrime = [&](uint64_t p) {       if (n % p == 0) {         result.push_back({p, 0});         while (n % p == 0) {           n /= p;           result.back().second++;         }       }     };     tryPrime(2);     for (uint64_t primeCandidate = 3; primeCandidate * primeCandidate <= n;          primeCandidate += 2)       tryPrime(primeCandidate);     if (n > 1) result.push_back({n, 1});     return result;   }   template <typename T>   void printVector(const std::vector<T>& out, std::string delimiter =    ) {     if (out.empty()) return;     for (size_t i = 0; i < out.size() - 1; ++i) std::cout << out[i] << delimiter;     std::cout << out.back();   }   class Solver576A {    public:     void run();   };   void Solver576A::run() {     int n;     cin >> n;     auto primes = generatePrimesUntil(n);     vector<int> ans;     for (auto p : primes)       for (int pp = p; pp <= n; pp *= p) ans.push_back(pp);     cout << ans.size() <<   n ;     printVector(ans);   }   using CurrentSolver = Solver576A;   int main() {     ios::sync_with_stdio(false);     CurrentSolver().run();     return 0;   }   