#include<bits/stdc++.h>
using namespace std;
typedef pair < int , int > Point;

bool cmp(Point &A, Point &B){
    if(B.first*A.second!=A.first*B.second)
        return (A.second*1.0)/A.first>(B.second*1.0)/B.first;
    else if(A.first!=B.first)
        return A<=B;
    else
        return A.second>B.second;
}

int dp[101][101];
const int INF = (int)1e9;
Point create(Point B , Point A){return {A.first-B.first,A.second-B.second};}
int cross(Point A,Point B){return A.first * B.second - B.first * A.second;}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    string S;
    while(cin>>S)
    {
        int N , i , j ;
        cin>>N;
        vector < Point > A(N+1);
        for(i=1;i<=N;++i)
            cin>>A[i].first>>A[i].second;
        sort(A.begin()+1,A.end(),cmp);
        A[0] = {0,0};
        for(i=0;i<=N;++i)
            for(j=0;j<=N;++j)
                dp[i][j] = -INF;
        int ans = 3;
        for(i=1;i<=N;++i)
        {
            dp[i][0] = 2;
            for(j=1;j<=i-1;++j)
            {
                for(int k=0;k<=j-1;++k)
                    if(cross(create(A[k],A[j]),create(A[j],A[i]))<0)
                        dp[i][j] = max(dp[i][j] , dp[j][k]+1);
                
                if( cross( create(A[j],A[i]) , create(A[i],A[0])  )<0)
                        ans = max(ans , dp[i][j]);
            }
        }
        cout<<"POLYGON.OUTnn";
        cout<<ans<<'n';
    }
    cout<<endl;
    return 0;
}