/*
 * Solution Template for Art Class II
 * 
 * Australian Informatics Olympiad 2021
 * 
 * This file is provided to assist with reading of input and writing of output 
 * for the problem. You may modify this file however you wish, or
 * you may choose not to use this file at all.
 */

#include <cstdio>

/* N is the number of holes. */
int N;

/* x and y contain the locations of the holes. */
int x[100005];
int y[100005];

int answer;

int main(void) {
    /* Read the value of N. */
    scanf("%d", &N);

    /* Read the location of each hole. */
    for (int i = 0; i < N; i++) {
        scanf("%d", &x[i]);
        scanf("%d", &y[i]);
    }

    /*
     * TODO: This is where you should compute your solution. Store the area of
     * the smallest poster that will cover all the holes into the variable
     * answer.
     */

    /* Write the answer. */
    printf("%d\n", answer);

    return 0;
}