#define _CRT_SECURE_NO_WARNINGS
#pragma GCC Optimize("Ofast")
#include <iostream>
#include <vector>
#include <set>
#include <chrono>
#include <string>
#include <time.h>
#include <unordered_set>
#include <cmath>
#include <map>
#include <queue>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <cstddef>
#include <cstdio>
#include <iostream>
#include <memory>
#include <stdexcept>
#include <string>
#include <array>
using namespace std;

#define vi vector<int>
#define vec vector
#define int long long
int gcd(int a, int b) {
    return b ? gcd(b, a % b) : a;
}
const int MOD = 1e9 + 7;

int binpow(int a, int b) {
    if (!b) return 1;
    int x = binpow(a, b >> 1);
    if (b & 1) {
        return (((x * x) % MOD) * a) % MOD;
    }
    return (((x * x) % MOD) * 1) % MOD;
}
#define double long double
vec<pair<double, double>> p = { { 0, 0} };
vec<pair<double, double>> cur;
int cc = 0;
double dist(pair<double, double> a, pair<double, double> b) {
    return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second);
}

void calc(int c, int x) {
    if (c == 0) {
        double a = dist(cur[0], cur[1]);
        double b = dist(cur[0], cur[2]);
        double c = dist(cur[1], cur[2]);
        if (abs(a - b) < 1e-5 && abs(a - c) < 1e-5 && abs(b - c) < 1e-5) {
            ++cc;
        }
    }
    else {
        for (int j = x; j < p.size(); ++j) {
            cur.push_back(p[j]);
            calc(c - 1, j + 1);
            cur.pop_back();
        }
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int cnt = 66;
    double pi = acos(-1);
    for (int i = 0; i < cnt; ++i) {
        p.push_back({ cos(2 * pi * i / cnt), sin(2 * pi * i / cnt) });
    }
    p = p;
    calc(3, 0);
    cout << cc;
}