#include // #include #define int long long #define inf 1000000007 #define pa pair #define ll long long #define pal pair #define ppap pair #define PI 3.14159265358979323846 #define paa pair #define mp make_pair #define pb push_back #define EPS (1e-10) int dx[8]={0,1,0,-1,1,1,-1,-1}; int dy[8]={1,0,-1,0,-1,1,1,-1}; using namespace std; class pa3{ public: int x; int y,z; pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {} bool operator < (const pa3 &p) const{ if(x!=p.x) return x (const pa3 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; return z>p.z; //return x != p.x ? x (const pa4 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; if(z!=p.z)return z>p.z; return w>p.w; //return x != p.x ? x (const pa2 &p) const{ return x != p.x ? x struct Segment{ Point p1,p2; }; double dot(Vector a,Vector b){ return a.x*b.x+a.y*b.y; } double cross(Vector a,Vector b){ return a.x*b.y-a.y*b.x; } bool parareru(Point a,Point b,Point c,Point d){ // if(abs(cross(a-b,d-c))b) return gcd(b,v); if(v==b) return b; if(b%v==0) return v; return gcd(v,b%v); } double distans(double x1,double y1,double x2,double y2){ double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2); return sqrt(rr); } int mod; int extgcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1; y = 0; return a; } int d = extgcd(b, a%b, y, x); y -= a/b * x; return d; } pa operator+(const pa & l,const pa & r) { return {l.first+r.first,l.second+r.second}; } int pr[1200010]; int inv[1200010]; int beki(int wa,int rr,int warukazu){ if(rr==0) return 1%warukazu; if(rr==1) return wa%warukazu; wa%=warukazu; if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu; ll zx=beki(wa,rr/2,warukazu); return (zx*zx)%warukazu; } double bekid(double w,int r){ if(r==0) return 1.0; if(r==1) return w; if(r%2) return bekid(w,r-1)*w; double f=bekid(w,r/2); return f*f; } int comb(int nn,int rr){ int r=pr[nn]*inv[rr]; r%=mod; r*=inv[nn-rr]; r%=mod; return r; } void gya(int ert){ pr[0]=1; for(int i=1;i<=ert;i++){ pr[i]=(pr[i-1]*i)%mod; } for(int i=0;i<=ert;i++) inv[i]=beki(pr[i],mod-2,mod); } // cin.tie(0); // ios::sync_with_stdio(false); //priority_queue,greater> pq; //sort(ve.begin(),ve.end(),greater()); //----------------kokomade tenpure------------ vectorve; vector solve(int n){ ve.clear(); while(n){ int i; for(i=100;;i--){ if(i*i<=n)break; } if(i*(i+2)<=n){ ve.pb(i); ve.pb(i+2); n-=i*(i+2); } else if(i*(i+1)<=n){ ve.pb(i); ve.pb(i+1); n-=i*(i+1); } else{ ve.pb(i); ve.pb(i); n-=i*i; } } return ve; cout<=10) exit(1); } signed main(){ cin.tie(0); ios::sync_with_stdio(false); int k; cin>>k; if(k==0){ cout<<1< ans= solve(k); //} int a[8]={3,4,5,6,29,30,51,46}; int wa=0; for(auto v:ans)wa+=v; cout<