import java.util.*;
import java.math.BigInteger;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int max_x=Integer.MIN_VALUE,max_y=Integer.MIN_VALUE,min_x=Integer.MAX_VALUE,min_y=Integer.MAX_VALUE;
int x =0,y=0;
for(int i =0;i<n;i++){
x=sc.nextInt();
y=sc.nextInt();
max_x = Math.max(x,max_x);
max_y = Math.max(y,max_y);
min_x = Math.min(x,min_x);
min_y = Math.min(y,min_y);
}
int max=Math.max(max_x-min_x,max_y-min_y);
BigInteger width = new BigInteger(max+"");
System.out.println(width.multiply(width));
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
if(n<=2){
System.out.println(-1);
return;
}
int[] lens=new int[n];
int sum =0,max=Integer.MIN_VALUE;
for(int i =0;i<n;i++){
lens[i]=sc.nextInt();
max = Math.max(max,lens[i]);
sum+=lens[i];
if((sum-max)>max){//最大边大于其他边之和即可满足有要求
System.out.println(i+1);
return;
}
}
System.out.println(-1);
}
}