#include<bits/stdc++.h>
using namespace std;
long long n,ans;
bool prime(int x){
    if(x==1||x==0)
        return false;
    for(long long i=2;i*i<=x;i++){
        if(x%i==0)
            return false;
    }
    return true;
}
int main(){
    freopen("gcd_prime.in","r",stdin);
    freopen("gcd_prime.out","w",stdout);
    cin>>n;
    for(long long i=1;i<=n;i++)
        for(long long j=1;j<=n;j++){
            if(prime(__gcd(i,j))){
               
                ans++;
            }
        }
    cout<<ans;
    return 0;
}