
import java.math.BigInteger;
import java.util.Scanner;


public class Main {
    public static int gcd(int a,int b)
    {
        if(b==0)
             return a;
        else
            return gcd(b,a%b);
    }

    public static void main(String[] args) {

     Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
     long  sum=0;
     for(int i = 1; i<=n; i++)
     {
         for(int j=1;j<=n;j++)
         {
             for(int k=1;k<=n;k++)
                  sum+=gcd(i,gcd(j,k));
         }

     }

     System.out.println(sum);

    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz