#include <stdio.h>
#define FIN "fractii.in"
#define FOUT "fractii.out"
void computePHI(long long int n, long long int *ptr) {
long long phi[n+1];
long long sum = 0;
for(int i = 1; i <= n; ++i) phi[i] = i;
for(int i = 2; i <= n; ++i) {
//daca este numar prim
if(phi[i]==i) {
for(int j = i; j <= n; j+=i) {
phi[j] = phi[j] / i * (i - 1);
}
}
sum+=phi[i];
}
*ptr=(sum<<1)+1;
}
int main(int argc, char const *argv[]) {
long long n, ans;
//freopen(FIN, "r", stdin);
//freopen(FOUT, "w", stdout);
computePHI(n,&ans);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNkZWZpbmUgRklOICJmcmFjdGlpLmluIgojZGVmaW5lIEZPVVQgImZyYWN0aWkub3V0IgoKdm9pZCBjb21wdXRlUEhJKGxvbmcgbG9uZyBpbnQgbiwgbG9uZyBsb25nIGludCAqcHRyKSB7CiAgICAgbG9uZyBsb25nIHBoaVtuKzFdOwogICAgIGxvbmcgbG9uZyBzdW0gPSAwOwogICAgIGZvcihpbnQgaSA9IDE7IGkgPD0gbjsgKytpKSBwaGlbaV0gPSBpOwogICAgIGZvcihpbnQgaSA9IDI7IGkgPD0gbjsgKytpKSB7CiAgICAgICAgIC8vZGFjYSBlc3RlIG51bWFyIHByaW0KICAgICAgICAgaWYocGhpW2ldPT1pKSB7CiAgICAgICAgICAgIGZvcihpbnQgaiA9IGk7IGogPD0gbjsgais9aSkgewogICAgICAgICAgICAgICAgcGhpW2pdID0gcGhpW2pdIC8gaSAqIChpIC0gMSk7CiAgICAgICAgICAgIH0KICAgICAgICAgfQogICAgICAgICBzdW0rPXBoaVtpXTsKICAgICB9CiAgICAgKnB0cj0oc3VtPDwxKSsxOwp9CgppbnQgbWFpbihpbnQgYXJnYywgY2hhciBjb25zdCAqYXJndltdKSB7CiAgbG9uZyBsb25nIG4sIGFuczsKICAvL2ZyZW9wZW4oRklOLCAiciIsIHN0ZGluKTsKICAvL2ZyZW9wZW4oRk9VVCwgInciLCBzdGRvdXQpOwogIHNjYW5mKCIlbGxkIiwmbik7CiAgY29tcHV0ZVBISShuLCZhbnMpOwogIHByaW50ZigiJWxsZCIsYW5zKTsKICByZXR1cm4gMDsKfQo=