// Original C++ solution (slower):
// May this submission get accepted

#include <bits/stdc++.h>



// エイリアス

using  ll = long signed long;

using ull = long unsigned long;

using  ld = long double;

using namespace std;



// AtCoder/Codeforces 用 デバッグ検知

#ifdef ONLINE_JUDGE

constexpr bool DEBUG_MODE = false;

#else

constexpr bool DEBUG_MODE = true;

#endif



// エイリアス (補完・コンパイルが重くなる)

// #include <boost/multiprecision/cpp_int.hpp>

// using mll = boost::multiprecision::cpp_int;



// 汎用マクロ

#define ALL_OF(x) (x).begin(), (x).end()

#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)

#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)

#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)

#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)

#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)

#define FOREACH(i,q) for (auto &i : q)

template<class T> bool chmax(T &a, const T b) { if (a < b) {a = b; return true;} return false; }

template<class T> bool chmin(T &a, const T b) { if (a > b) {a = b; return true;} return false; }

constexpr int INF = numeric_limits<int>::max();

constexpr long long LINF = numeric_limits<long long>::max();

constexpr long double EPS = 1e-10L;

#define Yes(q) ((q) ? "Yes" : "No")

#define YES(q) ((q) ? "YES" : "NO")

#define Possible(q) ((q) ? "Possible" : "Impossible")

#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

#define IIF(q,t,f) ((q) ? (t) : (f))

#define DUMP(q) DUMP_FUNC(q, #q, __FILE__, __LINE__)

template <typename T> void DUMP_PROC(T x) { if (is_integral<T>() || is_floating_point<T>()) cerr << "\e[32m" << x << "\e[m"; else cerr << x; }

template<> void DUMP_PROC<char>(char x) { cerr << "\e[36m\'" << x << "\'\e[m"; }

template<> void DUMP_PROC<string>(string x) { cerr << "\e[33m\"" << x << "\"\e[m"; }

template <typename T, typename U> void DUMP_PROC(pair<T, U> x) { cerr << "{"; DUMP_PROC(x.first); cerr << ", "; DUMP_PROC(x.second); cerr << "}"; }

template <typename ...T, typename U, U... Seq> void DUMP_PROC(tuple<T...> &x, integer_sequence<U, Seq...>) { (void)(int[]){(cerr << ((const char*[]){"", ", "})[!!Seq] << (DUMP_PROC(get<Seq>(x)), ""), 0)...}; }

template <typename ...T> void DUMP_PROC(tuple<T...> x) {cerr << "{"; DUMP_PROC(x, index_sequence_for<T...>()); cerr << "}";}

template <typename T> void DUMP_PROC(vector<T> x) { cerr << "["; for (auto &xi : x) { DUMP_PROC(xi); cerr << (&xi != &*x.rbegin()?", ":""); } cerr << "]"; }

template <typename T> void DUMP_FUNC(T x, const char* name, const char* fn, int ln) { cerr << "\e[32m[DEBUG]\e[m " << name << ": "; DUMP_PROC(x); cerr << " @ " << fn << "(" << ln << ")" << endl; }



// gcc拡張マクロ

#define popcount __builtin_popcount

#define popcountll __builtin_popcountll



// 標準入出力

struct qin { // query input

    size_t sz;

    qin(size_t _sz = 1) : sz(_sz) {}

    template <typename T> operator T () const { T a; cin >> a; return a; }

    template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }

    template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }

};

qin in1; // input one

template <typename T> void say(const T x, const char* end = "\n") { cout << x << end; }

void say(const ld x, const char* end = "\n") { cout << setprecision(30) << x << end; }

template <typename T> void say(const vector<T> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { cout << x[i] << (i+1 == i_len ? end : sep); } }

template <typename T> void say(const vector<vector<T>> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { say(x[i], sep, end); } }



// モジュール

// [[LIBRARY]]



// 処理内容

int main() {

    

    ios::sync_with_stdio(false); // stdioを使うときはコメントアウトすること

    cin.tie(nullptr);            // インタラクティブ問題ではコメントアウトすること

    

    ll k = in1;

    ll ans = 0;

    RANGE(a, 1, k)

    RANGE(b, 1, k)

    RANGE(c, 1, k) {

        ans += gcd(gcd(a,b),c);

    }

    say(ans);

    

}

// Optimized solution to the same problem (faster):
// May this submission get accepted

#include <bits/stdc++.h>



// エイリアス

using  ll = long signed long;

using ull = long unsigned long;

using  ld = long double;

using namespace std;



// AtCoder/Codeforces 用 デバッグ検知

#ifdef ONLINE_JUDGE

constexpr bool DEBUG_MODE = false;

#else

constexpr bool DEBUG_MODE = true;

#endif



// エイリアス (補完・コンパイルが重くなる)

// #include <boost/multiprecision/cpp_int.hpp>

// using mll = boost::multiprecision::cpp_int;



// 汎用マクロ

#define ALL_OF(x) (x).begin(), (x).end()

#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)

#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)

#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)

#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)

#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)

#define FOREACH(i,q) for (auto &i : q)

template<class T> bool chmax(T &a, const T b) { if (a < b) {a = b; return true;} return false; }

template<class T> bool chmin(T &a, const T b) { if (a > b) {a = b; return true;} return false; }

constexpr int INF = numeric_limits<int>::max();

constexpr long long LINF = numeric_limits<long long>::max();

constexpr long double EPS = 1e-10L;

#define Yes(q) ((q) ? "Yes" : "No")

#define YES(q) ((q) ? "YES" : "NO")

#define Possible(q) ((q) ? "Possible" : "Impossible")

#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

#define IIF(q,t,f) ((q) ? (t) : (f))

#define DUMP(q) DUMP_FUNC(q, #q, __FILE__, __LINE__)

template <typename T> void DUMP_PROC(T x) { if (is_integral<T>() || is_floating_point<T>()) cerr << "\e[32m" << x << "\e[m"; else cerr << x; }

template<> void DUMP_PROC<char>(char x) { cerr << "\e[36m\'" << x << "\'\e[m"; }

template<> void DUMP_PROC<string>(string x) { cerr << "\e[33m\"" << x << "\"\e[m"; }

template <typename T, typename U> void DUMP_PROC(pair<T, U> x) { cerr << "{"; DUMP_PROC(x.first); cerr << ", "; DUMP_PROC(x.second); cerr << "}"; }

template <typename ...T, typename U, U... Seq> void DUMP_PROC(tuple<T...> &x, integer_sequence<U, Seq...>) { (void)(int[]){(cerr << ((const char*[]){"", ", "})[!!Seq] << (DUMP_PROC(get<Seq>(x)), ""), 0)...}; }

template <typename ...T> void DUMP_PROC(tuple<T...> x) {cerr << "{"; DUMP_PROC(x, index_sequence_for<T...>()); cerr << "}";}

template <typename T> void DUMP_PROC(vector<T> x) { cerr << "["; for (auto &xi : x) { DUMP_PROC(xi); cerr << (&xi != &*x.rbegin()?", ":""); } cerr << "]"; }

template <typename T> void DUMP_FUNC(T x, const char* name, const char* fn, int ln) { cerr << "\e[32m[DEBUG]\e[m " << name << ": "; DUMP_PROC(x); cerr << " @ " << fn << "(" << ln << ")" << endl; }



// gcc拡張マクロ

#define popcount __builtin_popcount

#define popcountll __builtin_popcountll



// 標準入出力

struct qin { // query input

    size_t sz;

    qin(size_t _sz = 1) : sz(_sz) {}

    template <typename T> operator T () const { T a; cin >> a; return a; }

    template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }

    template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }

};

qin in1; // input one

template <typename T> void say(const T x, const char* end = "\n") { cout << x << end; }

void say(const ld x, const char* end = "\n") { cout << setprecision(30) << x << end; }

template <typename T> void say(const vector<T> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { cout << x[i] << (i+1 == i_len ? end : sep); } }

template <typename T> void say(const vector<vector<T>> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { say(x[i], sep, end); } }



// モジュール

// [[LIBRARY]]



// 処理内容

int main() {

    

    ios::sync_with_stdio(false); // stdioを使うときはコメントアウトすること

    cin.tie(nullptr);            // インタラクティブ問題ではコメントアウトすること

    

    say((int[]){0,1,9,30,76,141,267,400,624,885,1249,1590,2208,2689,3411,4248,5248,6081,7485,8530,10248,11889,13687,15228,17988,20053,22569,25242,28588,31053,35463,38284,42540,46581,50893,55362,61824,65857,71247,76884,84388,89349,97881,103342,111528,120141,128047,134580,146316,154177,164817,174438,185836,194157,207927,218812,233268,245277,257857,268182,288216,299257,313635,330204,347836,362973,383709,397042,416448,434025,456967,471948,499740,515581,536073,559758,583960,604833,633651,652216,683712,709065,734233,754734,793188,818917,846603,874512,909496,933081,977145,1006126,1041504,1073385,1106467,1138536,1187112,1215145,1255101,1295142,1342852,1373253,1422195,1453816,1502376,1553361,1595437,1629570,1691292,1726717,1782111,1827492,1887772,1925853,1986837,2033674,2089776,2145333,2197483,2246640,2332104,2379085,2434833,2490534,2554600,2609625,2693919,2742052,2813988,2875245,2952085,3003306,3096024,3157249,3224511,3306240,3388576,3444609,3533637,3591322,3693924,3767085,3842623,3912324,4027884,4102093,4181949,4270422,4361548,4427853,4548003,4616104,4718640,4812789,4918561,5003286,5131848,5205481,5299011,5392008,5521384,5610705,5739009,5818390,5930196,6052893,6156139,6239472,6402720,6493681,6623853,6741078,6864016,6953457,7094451,7215016,7359936,7475145,7593865,7689630,7886244,7984165,8130747,8253888,8403448,8523897,8684853,8802826,8949612,9105537,9267595,9376656,9574704,9686065,9827097,9997134,10174780,10290813,10493367,10611772,10813692}[(ll)in1]);

    

}

// Fastest known solution for this problem: