#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define point pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define x first
#define y second

using namespace std;

const int nmax = 100005;

int n, i;
ll sol;
point p[nmax];

int main()
{
    freopen("aria.in", "r", stdin);
    freopen("aria.out", "w", stdout);

    scanf("%d", &n);

    for(i = 1; i <= n; i++)
        scanf("%d%d", &p[i].x, &p[i].y);

    p[n + 1] = p[1];
    for(i = 1; i <= n; i++)
        sol += 1LL * p[i].x * p[i + 1].y - 1LL * p[i].y * p[i + 1].x;

    sol = abs(sol);

    printf("%.6f\n", sol / 2.0);

    return 0;
}