1 #include
2 using namespace std;
3
4 bool isPrime(int n) {
5 if (n <= 1) {
6 return false;
7 }
8 for (int i = 2; i * i <= n; i++) {
9 if (n % i == 0) {
10 return false;
11 }
12 }
13 return true;
14 }
15
16 int countPrimes(int n) {
17 int count = 0;
18 for (int i = 2; i <= n; i++) {
19 if (isPrime(i)) {
20 count++;
21 }
22 }
23 return count;
24 }
25
26 int sumPrimes(int n) {
27 int sum = 0;
28 for (int i = 2; i <= n; i++) {
29 if (isPrime(i)) {
30 sum += i;
31 }
32 }
33 return sum;
34 }
35
36 int main() {
37 int x;
38 cin >> x;
39 cout << countPrimes(x) << " " << sumPrimes(x) << endl;
40 return 0;
41 }