#include #define MAP(BODY) Map([](auto const X1) { return BODY; }) #define vec(N, I) make_vec(N, I) #define rep(i, n) for (int i = 0; i < (int)(n); i++) template std::vector make_vec(N n, T i) { return std::vector(n, i); } template auto operator|(const A &a, const F &f) { return f(a); } template std::ostream &operator<<(std::ostream &os, const std::vector &vec) { os << "["; const size_t vec_len = vec.size(); if (vec_len > 0) { for (int i = 0; i < vec_len - 1; i++) { os << vec[i] << ',' << ' '; } os << vec[vec_len - 1]; } os << "]\n"; return os; } template std::ostream &operator<<(std::ostream &os, const std::set &vec) { os << "{"; auto i = vec.begin(); while (i != vec.end()) std::cout << *i++ << ","; os << "\b}"; return os; } template std::ostream &operator<<(std::ostream &os, const std::vector> &vec) { os << '{'; vec | MAP(({ std::cout << "<" << X1.first << "," << X1.second << ">" << std::endl, X1; })); os << "}\n"; return os; } template std::ostream &operator<<(std::ostream &os, const std::pair &tar) { os << '<' << tar.first << ',' << tar.second << '>' << std::endl; return os; } auto print = [](const auto a) { std::cout << a << std::endl; return a; }; template auto Map(F f) { return [=](const auto &ma) { return map_instance(f, ma); }; } template auto map_instance(F f, const std::vector &vec) { using R = typename std::result_of::type; int size = vec.size(); std::vector result(size); for (int i = 0; i < size; i++) { result[i] = f(vec[i]); } return result; } using namespace std; typedef long long int ll; typedef unsigned long long int ull; typedef unsigned long long int ull; typedef pair pll; typedef pair pull; typedef pair pi; ll N; bool prime(int n) { // 0,1の場合は素数ではない if (n < 2) return false; // √n まででよいということは i*i<=n までチェックすることと同じ for (int i = 2; i * i <= n; i++) { if (n % i == 0) { return false; } } // 1と自分自身以外で割り切れる数が無かったので素数 return true; } int main() { cin >> N; ll n = 2; ull result = 0; // N|print; // n|print; while (n * n <= N) { n | print; ll prev = n ; while (prev * n <= N) { result += prev * n; prev *= n; } n++; while (!prime(n)) { n++; } } result | print; }