#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 305;
struct P
{
    double x, y;
}p[maxn];
typedef P V;

V operator -(const P&a, const P&b)
{
    V ans;
    ans.x = a.x - b.x;
    ans.y = a.y - b.y;
    return ans;
}
double operator ^ (const V &a, const V b)
{
    return a.x * b.y - a.y * b.x;
}
inline bool check(const P &a, const P &b, const P &c, const P &d)
{
    double x, y, z;
    x = (b-a) ^ (d-a);
    y = (c-b) ^ (d-b);
    z = (a-c) ^ (d-c);
    if(x > 0 && y > 0 && z > 0) return true;
    if(x < 0 && y < 0 && z < 0) return true;
    return false;
}
int N, ans[maxn];
void init()
{
    scanf("%d", &N);
    for(int i = 0;i < N;++i) scanf("%lf%lf", &p[i].x, &p[i].y);
    for(int i = 0;i < N;++i) for(int j = i+1;j < N;++j) for(int k = j+1;k < N;++k)
    {
        int tmp = 0;
        for(int d = 0;d < N;++d) if(d != i && d != j && d != k)
        {
            if(check(p[i], p[j], p[k], p[d])) ++tmp;
        }
        ++ans[tmp+3];
    }
    int mx = 0;
    for(int i = 1;i < maxn;++i) if(ans[i])
    {
        mx = i;
    }
    printf("%d\n%d\n", mx, ans[mx]);
}
int main()
{
    #ifdef DEBUG
    freopen("test.txt", "r", stdin);
    #else
    freopen("trib.in", "r", stdin);
    freopen("trib.out", "w", stdout);
    #endif // DEBUG
    init();
    return 0;
}