import java.util.*;
import java.awt.*;
public class g {
	Scanner in=new Scanner(System.in);
	public static void main(String[] args) {
		new g().go();
	}
	private void go() {
		int n=in.nextInt();
		int[][] p=new int[n][2];
		ArrayList<Integer> x=new ArrayList<Integer>(),y=new ArrayList<Integer>();
		for(int i=0;i<n;i++){
			p[i][0]=in.nextInt();
			p[i][1]=in.nextInt();
			x.add(p[i][0]);
			y.add(p[i][1]);
		}
		int d=in.nextInt();
		Collections.sort(x);
		Collections.sort(y);
		Point bot=new Point(p[0][0],p[0][1]-d);//compute valid box in rectangular points (cuz it's easy in java)
		Rectangle r=new Rectangle(bot.y+bot.x,bot.y-bot.x,2*d,2*d);
		for(int i=1;i<n;i++){
			bot=new Point(p[i][0],p[i][1]-d);
			r=r.intersection(new Rectangle(bot.y+bot.x,bot.y-bot.x,2*d,2*d));
		}
		if(r.getHeight()<0 || r.getWidth()<0){
			System.out.println("impossible");
			System.exit(0);
		}
		if(x.size()%2==0){//min lies on box boundary unless box wholly contains the median
			int xl=x.get(n/2-1),xh=x.get(n/2),yl=y.get(n/2-1),yh=y.get(n/2);
			if(r.contains(yl+xl,yl-xl)&&r.contains(yl+xh,yl-xh)&&r.contains(yh+xl,yh-xl)&&r.contains(yh+xh,yh-xh)){
				System.out.println(tot(xl,yl,p,d));
				System.exit(0);
			}
		} else {
			int xx=x.get(n/2),yy=y.get(n/2);
			if(r.contains(yy+xx,yy-xx)){
				System.out.println(tot(xx,yy,p,d));
				System.exit(0);
			}
		}//at least some part of the median is outside the box, min is along one of the edges
		long min=Integer.MAX_VALUE;
		double[][] bs=new double[4][2];
		bs[0][0]=r.getMinX()-r.getMinY();
		bs[0][1]=r.getMinX()+r.getMinY();
		bs[1][0]=r.getMaxX()-r.getMinY();
		bs[1][1]=r.getMaxX()+r.getMinY();
		bs[2][0]=r.getMaxX()-r.getMaxY();
		bs[2][1]=r.getMaxX()+r.getMaxY();
		bs[3][0]=r.getMinX()-r.getMaxY();
		bs[3][1]=r.getMinX()+r.getMaxY();
		for(int i=0;i<4;i++)for(int j=0;j<2;j++)bs[i][j]/=2;//convert back to diagonal coordinates before ternary searching
		for(int i=0;i<4;i++){
			min=Math.min(min,tern(bs[i][0],bs[i][1],bs[(i+1)%4][0],bs[(i+1)%4][1],p,d));
		}
		System.out.println(min);
	}
	private long tern(double d, double e, double f, double g,int[][] p,long dd) {//min of ternary search over the edge
		while(Math.abs(f-d)>.1||Math.abs(g-e)>.1){
			double h=d+(f-d)/3,i=e+(g-e)/3,j=d+2*(f-d)/3,k=e+2*(g-e)/3;
			if(tot(h,i,p,dd)<tot(j,k,p,dd)){
				f=j;
				g=k;
			} else {
				d=h;
				e=i;
			}
		}//Next line guarantees we have an integral value...since easier to ternary search with float values
		return Math.min(tot(Math.floor(d),Math.floor(e),p,dd),Math.min(tot(Math.floor(d),Math.ceil(e),p,dd), Math.min(tot(Math.ceil(d),Math.floor(e),p,dd),tot(Math.ceil(d),Math.ceil(e),p,dd))));
	}
	private long tot(double x,double y,int[][] p,long d) {
		long out=0;
		for(int i=0;i<p.length;i++){
			long temp=(long) (Math.abs(x-p[i][0])+Math.abs(y-p[i][1]));
			if(temp>d)return Long.MAX_VALUE;
			out+=temp;
		}
		return out;
	}
}