Pagini recente » Cod sursa (job #1286184) | Cod sursa (job #488547) | Cod sursa (job #3261264) | Cod sursa (job #2934344) | Cod sursa (job #3215638)
#pragma GCC optimize ("03", "Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define INFILE "fractii.in"
#define OUTFILE "fractii.out"
typedef long long ll;
const int N_MAX = 1e6 + 5;
int phi[N_MAX];
void init(){
for(int i = 1; i < N_MAX; ++i) phi[i] = i - 1;
for(int i = 2; i < N_MAX; ++i){
for(int d = 2 * i; d < N_MAX; d += i) phi[d] -= phi[i];
}
}
void solve(){
int n; cin >> n;
ll ans = 0;
for(int i = 1; i <= n; ++i) ans += phi[i];
cout << 2 * ans + 1 << '\n';
}
int main(){
ios_base::sync_with_stdio(false);
freopen(INFILE, "r", stdin);
freopen(OUTFILE, "w", stdout);
cin.tie(0), cout.tie(0);
init();
solve();
return 0;
}