import java.util.*;
class Main
{
  static int gcd(int a, int b) 
    { 
        if (a == 0) 
            return b; 
        return gcd(b % a, a); 
    } 
    static int findGCD(int arr[], int n) 
    { 
        int result = arr[0]; 
        for (int i = 1; i < n; i++) 
            result = gcd(arr[i], result); 
  
        return result; 
    } 
  public static void main(String args[])
  {
    long sum=0;
    int a[]=new int [3];
    Scanner sc=new Scanner(System.in);
    int k=sc.nextInt();
    for(int i=1;i<=k;i++)
    {
      for(int j=1;j<=k;j++)
      {
        for(int x=1;x<=k;x++)
        {
            a[0]=i;
          	a[1]=j;
          	a[2]=x;
        	sum+=findGCD(a,3);
        }
      }
    }
    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