// Allen Lin

// ACSL Contest #4

// Holmdel High School

// 2005-2006

// Senior 3 Division

import java.io.*;

import java.util.*;

import java.text.*;

public class pathways

{

public static void main(String args[]) throws IOException

{

BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

//BufferedReader in = new BufferedReader(new FileReader("pathways.in"));

System.out.println("ASCL Contest #4 2005-2006");

int temp[][] = new int[200][2];

String t = in.readLine();

StringTokenizer tokens = new StringTokenizer(t,", ");

int i = 0;

while(tokens.hasMoreTokens())

{

String s = tokens.nextToken();

if(s.equals("0"))

break;

temp[i][0] = Integer.parseInt(s);

temp[i][1] = Integer.parseInt(tokens.nextToken());

i++;

}

int count = i;

int largest = 0;

for(i=0;i<count;i++)

{

if(temp[i][0]>largest)

largest = temp[i][0];

if(temp[i][1]>largest)

largest = temp[i][1];

}

int arr[][] = new int[largest+1][largest+1];

for(i=0;i<count;i++)

{

arr[temp[i][0]][temp[i][1]] = 1;

}

for(i=0;i<10;i++)

{

//System.out.println("here");

t = in.readLine();

tokens = new StringTokenizer(t,", ");

int a1 = Integer.parseInt(tokens.nextToken());

int a2 = Integer.parseInt(tokens.nextToken());

int b1 = Integer.parseInt(tokens.nextToken());

int b2 = Integer.parseInt(tokens.nextToken());

int print = recur(a1,a2,b1,b2,0,arr);

if(print>=10000)

System.out.println("NONE");

else

System.out.println(print);

}

}

public static int recur(int x, int y, int b1, int b2, int steps, int arr[][])

{

//System.out.println("steps: "+steps+" x: "+x+" y: "+y);

//print(arr);

if(b1 >= arr.length || b2 >= arr.length)

return 10000;

if(x==b1&&y==b2)

{

if(arr[b1][b2]!=1)

return 10000;

return steps;

}

else if(x==0||y==0||x==arr.length||y==arr.length)

return 10000;

else if(arr[x][y]!=1)

return 10000;

steps++;

int len = 10000;

arr[x][y] = 2;

int len1 = recur(x-1,y-1,b1,b2,steps,arr);

int len2 = recur(x-1,y,b1,b2,steps,arr);

int len3 = recur(x-1,y+1,b1,b2,steps,arr);

int len4 = recur(x,y+1,b1,b2,steps,arr);

int len5 = recur(x,y-1,b1,b2,steps,arr);

int len6 = recur(x+1,y-1,b1,b2,steps,arr);

int len7 = recur(x+1,y,b1,b2,steps,arr);

int len8 = recur(x+1,y+1,b1,b2,steps,arr);

arr[x][y] = 1;

if(len1<len)

len = len1;

if(len2<len)

len = len2;

if(len3<len)

len = len3;

if(len4<len)

len = len4;

if(len5<len)

len = len5;

if(len6<len)

len = len6;

if(len7<len)

len = len7;

if(len8<len)

len = len8;

return len;

}

public static void print(int arr[][])

{

for(int i=0;i<arr.length;i++)

{

for(int j=0;j<arr.length;j++)

{

System.out.print(arr[i][j]);

}

System.out.println("");

}

}

}