#include<bits/stdc++.h>
using namespace std;
//const int N=10000000;
int n;
//int p[N],v[N];
int m=0,cnt=0;
long long gcd(long long a,long long b)
{
    return b==0?a:gcd(b,a%b);
}
/*void primes(int n)
{
    memset(v,0,sizeof(v));
    for(int i=2;i<=n;i++)
    {
        if(!v[i]) v[i]=i,p[++m]=i;
        for(int j=1;j<=m;j++)
        {
            if(v[i]<p[j]) break;
            if(i*p[j]>n) break;
            v[i*p[j]]=p[j];
        }
    }
    return 0;
}*/
bool prime(int n)
{
    if(n==1) return false;
    for(int i=2;i*i<=n;i++)
        if(n%i==0) return false;
    return true;
}
int main()
{
    freopen("gcd_prime.in","r",stdin);
    freopen("gcd_prime.out","w",stdout);
    
    cin>>n;
    //primes(n);
    for(long long i=2;i<=n;i++) for(long long j=2;j<=n;j++) if(prime(gcd(i,j))) cnt++;
    cout<<cnt<<endl;
    return 0;
}