1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <bits/stdc++.h>
using namespace std;
const int N_max=5000; 
typedef long long ll;
int n, res;
vector <int> sq_n;
struct VectorComparator {
    bool operator()(const vector<int>& a, const vector<int>& b) const {
        return a < b; 
    }
};
set <vector <int>, VectorComparator > zbiory[N_max*N_max+1];
void make_0_vector(){
    vector <int> v0;
    for(int i=0; i<3; i++){
        v0.push_back(0);
    }
    zbiory[0].insert(v0);
    return ;
}
vector <int> make_new_vector(vector<int> vec, int i){
    vec[i]++;
    sort(vec.begin(), vec.end());
    return vec;
}
int count_comb(vector<int> v){
    int l_powt=0;
    if(v[0]==v[1]){l_powt++;}
    if(v[1]==v[2]){l_powt++;}
    if(v[0]==v[2]){l_powt++;}
    if(l_powt==3){return 3;}
    if (l_powt==1){return 2;}
    return 1;
}
int main()
{
    
    cin>>n;
    for (int i=1; i<=n; i++){
        sq_n.push_back(i*i);
    }
    make_0_vector();
    for(int i=0; i<=n*n; i++){
        auto it=zbiory[i].begin();
        for (;it!=zbiory[i].end();it++){
            for (int j=0; j<3; j++){
                int new_ind=2*((*it)[j])+1 + i;
                if(new_ind>n*n){continue;}
                zbiory[new_ind].insert(make_new_vector((*it), j));
            }
        }
    }
    for (int i=0; i<sq_n.size(); i++){
        auto it=zbiory[i].begin();
        for (;it!=zbiory[i].end();it++){
            res+=count_comb((*it));
        }
    }
    cout<<res;
    //return 0;
}