/********************* Template ************************/

#include <set>

#include <map>

#include <list>

#include <cmath>

#include <ctime>

#include <deque>

#include <queue>

#include <stack>

#include <bitset>

#include <cstdio>

#include <string>

#include <vector>

#include <cassert>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <fstream>

#include <numeric>

#include <iomanip>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define EPS         1e-8

#define MAXN        100005

#define MOD         (int)1e9+7

#define PI          acos(-1.0)

#define INF         ((1LL)<<50)

#define max(a,b)    ((a) > (b) ? (a) : (b))

#define min(a,b)    ((a) < (b) ? (a) : (b))

#define max3(a,b,c) (max(max(a,b),c))

#define min3(a,b,c) (min(min(a,b),c))

#define BUG         cout<<"BUG! "<<endl

#define LINE        cout<<"------------------"<<endl

#define L(t)        (t << 1)

#define R(t)        (t << 1 | 1)

#define Mid(a,b)    ((a + b) >> 1)

#define lowbit(a)   (a & -a)

#define FIN         freopen("in.txt","r",stdin)

#pragma comment     (linker,"/STACK:102400000,102400000")

// typedef long long LL;

// typedef unsigned long long ULL;

// typedef __int64 LL;

// typedef unisigned __int64 ULL;

// int gcd(int a,int b){ return b?gcd(b,a%b):a; }

// int lcm(int a,int b){ return a*b/gcd(a,b); }

/*********************   F   ************************/

struct POINT{

    double x,y;

    POINT(double _x = , double _y = ):x(_x),y(_y){};

    void show(){

        cout<<x<<" "<<y<<endl;

    }

};

POINT p[MAXN],s[MAXN];

double dist(POINT p1,POINT p2){

    return((p1.x-p2.x) * (p1.x-p2.x) + (p1.y-p2.y) * (p1.y-p2.y));

}

double multiply(POINT sp,POINT ep,POINT op){

    return (sp.x-op.x) * (ep.y-op.y) - (ep.x-op.x) * (sp.y-op.y);

}

bool ptcmp(POINT a,POINT b){    // 极角排序cmp p[]为全局变量

    if(multiply(a,b,p[]) == ) return dist(p[],a) < dist(p[],b);

    return (multiply(a,b,p[]) > );

}

int Graham_scan(POINT p[],POINT s[],int n){ //  返回凸包点的个数(修改版处理共线,无凸包)

    int i,k = ,top = ;

    for(i = ; i < n ; i++)     //  取y最小且x最小的点为凸包起点

        if((p[i].y < p[k].y) || ((p[i].y == p[k].y) && (p[i].x < p[k].x)))

            k = i;

    swap(p[],p[k]);            //  起点设置为p[0]

    if(n == ) {                //  只有两个点不构成凸包的特判

        s[] = p[];

        s[] = p[];

        return ;

    }

    sort(p+,p+n,ptcmp);        //  极角排序

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

        s[i] = p[i];            //  前三个点入栈

    if(n ==  && multiply(s[],s[],s[]) != ) return ;// 解决三个点且不共线的bug...

    while(multiply(s[],s[top],s[top-]) ==  && i < n){ // 前三个点的共线特判

        s[top-] = s[top];

        s[top] = p[i++];

    }

    if(i == n){                 //所有点都共线的特判

        s[] = s[top];

        return ;

    }

    for(; i < n ; i++){

        while(multiply(p[i],s[top],s[top-]) >= )

            top--;

        s[++top] = p[i];

    }

    return top + ;

}

double Triangle_area(POINT a,POINT b,POINT c){

    return fabs(multiply(a,b,c)/);

}

double Rotation_Calipers(int len){      //旋转卡壳求凸包最大三角形

    double ans = ;

    for(int i =  ; i < len ; i++){

        int j = (i + ) % len;

        int k = (j + ) % len;

        while(j != i && k != i){

            ans = max(ans,Triangle_area(s[i],s[j],s[k]));

            while(Triangle_area(s[i],s[j],s[(k+)%len]) > Triangle_area(s[i],s[j],s[k]))

                k = (k + ) % len;

            j = (j + ) % len;

        }

    }

    return ans;

}

int main()

{

    //freopen("in.txt","r",stdin);

    //freopen("ou.txt","w",stdout);

    int n;

    while(~scanf("%d",&n)){

        if(n == -) break;

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

            scanf("%lf%lf",&p[i].x,&p[i].y);

        int len = Graham_scan(p,s,n);

        double ans = Rotation_Calipers(len);

        printf("%.2lf\n",ans);

    }

    return ;

}