#include <iostream>

#include <algorithm>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <ctime>

#include <queue>

using namespace std;

template<const int _n>

struct Edge

{

    struct Edge_base { int    to,w,next; }e[_n];

    int    cnt,p[_n];

    Edge() { clear(); }

    void    clear() { cnt=,memset(p,,sizeof(p)); }

    int    start(const int x) { return p[x]; }

    Edge_base&    operator[](const int x) { return e[x]; }

    void    insert(const int x,const int y,const int z)

    { e[++cnt].to=y; e[cnt].next=p[x]; e[cnt].w=z; p[x]=cnt; return ; }

};

int    n,level[],cur[],SSS,TTT,Ans;

Edge<>    e;

bool    Bfs(const int S)

{

    int    i,t;

    queue<int>    Q;

    memset(level,,sizeof(level));

    level[S]=;

    Q.push(S);

    while(!Q.empty())

    {

        t=Q.front(),Q.pop();

        for(i=e.start(t);i;i=e[i].next)

        {

            if(!level[e[i].to] && e[i].w)

            {

                level[e[i].to]=level[t]+;

                Q.push(e[i].to);

            }

        }

    }

    return level[TTT];

}

int    Dfs(const int S,const int bk)

{

    if(S==TTT)return bk;

    int    rest=bk;

    for(int &i=cur[S];i;i=e[i].next)

    {

        if(level[e[i].to]==level[S]+ && e[i].w)

        {

            int    flow=Dfs(e[i].to,min(rest,e[i].w));

            e[i].w-=flow;

            e[i^].w+=flow;

            if((rest-=flow)<=)break;

        }

    }

    if(rest==bk)level[S]=;

    return bk-rest;

}

int    Dinic()

{

    while(Bfs(SSS))

    {

        memcpy(cur,e.p,sizeof(cur));

        Ans+=Dfs(SSS,0x3f3f3f3f);

    }

    return Ans;

}

int    Build()

{

    SSS=,TTT=SSS+;

    int    j;

    e.insert(SSS,,);

    e.insert(,SSS,);

    e.insert(,TTT,);

    e.insert(TTT,,);

    for(j=;j-Dinic()<=n;)

    {

        j++;

        e.insert(SSS,j,),e.insert(j,SSS,);

        e.insert(j+,TTT,),e.insert(TTT,j+,);

        for(int i=;i<j;++i)

        {

            int t=i+j;

            for(int k=;k*k<=t;++k)

                if(t==k*k)

                {

                    e.insert(i,j+,);

                    e.insert(j+,i,);

                    break;

                }

        }

    }

    return j;

}

int main()

{

    freopen("balla.in","r",stdin);

    freopen("balla.out","w",stdout);

    int    mid;

    scanf("%d",&n);

    mid=Build();

    printf("%d\n",mid-);

    return ;

}