import java.util.Scanner;

public class Main {

    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 <= i; j++) {
                for (int k = 1; k <= j; k++) {
                    int count = Math.max(Math.max(i, j), k);
                    while (count > 0) {
                        if (i == j && j == k) {
                            sum += count;
                            break;
                        } else {
                            if (i % count == 0 && j % count == 0 && k % count == 0) {
                                if (i != j && i != k && j != k) {
                                    sum += 6 * count;
                                } else {
                                    sum += 3 * count;
                                }
                                break;
                            }
                        }
                        count--;
                    }
                }
            }
        }

        System.out.printf("%d\n", sum);
        sc.close();
    }
}
/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