最小的矩形

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        int N = in.nextInt();
        int[] x = new int[N];
        int[] y = new int[N];
        int min_y = Integer.MAX_VALUE;
        int max_y = Integer.MIN_VALUE;
        int max_x = Integer.MIN_VALUE;
        int min_x = Integer.MAX_VALUE;
        int j = 0;
        for ( int i = 0 ; i < 2 * N ; i++){
            if ( i % 2 == 0){
                x[j] = in.nextInt();
                if ( x[j] > max_x){
                    max_x = x[j];
                }
                if ( x[j] < min_x){
                    min_x = x[j];
                }
            }else{
                y[j] = in.nextInt();
                if ( y[j] > max_y){
                    max_y = y[j];
                }
                if ( y[j] < min_y){
                    min_y = y[j];
                }
                j++;
            }
        }
        System.out.print(Math.abs(max_x-min_x)*Math.abs(max_y-min_y));
        in.close();
    }

}