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