#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "aria.in";
const char outfile[] = "aria.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 100005;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct Point {
    double x, y;
};

int N;
Point A[MAXN], B[MAXN];

inline double myAbs(const double &d) {
    return max(d, -d);
}

inline double Area(const Point *P, const int &N) {
    double _area = 0;
    for(int i = 1 ; i <= N ; ++ i)
        _area += (P[i].x * P[i + 1].y - P[i + 1].x * P[i].y);
    _area *= 0.5;
    return myAbs(_area);
}

int main() {
    fin >> N;
    for(int i = 1 ; i <= N ; ++ i)
        fin >> A[i].x >> A[i].y;
    A[N + 1] = A[1];
    fout << fixed << setprecision(5) << Area(A, N) << '\n';
    fin.close();
    fout.close();
    return 0;
}