Problem: You have to organize a wedding party. The program of the party will include a concentration game played by the bride and groom. The arrangement of the concentration game should be easy since this game will be played to make the party fun.

We have a 4x4 board and 8 pairs of cards (denoted by `A' to `H') for the concentration game:


+---+---+---+---+
|   |   |   |   |   A A B B
+---+---+---+---+   C C D D
|   |   |   |   |   E E F F
+---+---+---+---+   G G H H
|   |   |   |   |
+---+---+---+---+
|   |   |   |   |
+---+---+---+---+


To start the game, it is necessary to arrange all 16 cards face down on the board. For example:


+---+---+---+---+
| A | B | A | B |
+---+---+---+---+
| C | D | C | D |
+---+---+---+---+
| E | F | G | H |
+---+---+---+---+
| G | H | E | F |
+---+---+---+---+


The purpose of the concentration game is to expose as many cards as possible by repeatedly performing the following procedure: (1) expose two cards, (2) keep them open if they match or replace them face down if they do not.

Since the arrangements should be simple, every pair of cards on the board must obey the following condition: the relative position of one card to the other card of the pair must be one of 4 given relative positions. The 4 relative positions are different from one another and they are selected from the following 24 candidates:


(1, 0), (2, 0), (3, 0),
(-3, 1), (-2, 1), (-1, 1), (0, 1), (1, 1), (2, 1), (3, 1),
(-3, 2), (-2, 2), (-1, 2), (0, 2), (1, 2), (2, 2), (3, 2),
(-3, 3), (-2, 3), (-1, 3), (0, 3), (1, 3), (2, 3), (3, 3).


Your job in this problem is to write a program that reports the total number of board arrangements which satisfy the given constraint. For example, if relative positions (-2, 1), (-1, 1), (1, 1), (1, 2) are given, the total number of board arrangements is two, where the following two arrangements satisfy the given constraint:


X0  X1  X2  X3             X0  X1  X2  X3
+---+---+---+---+          +---+---+---+---+
Y0 | A | B | C | D |       Y0 | A | B | C | D |
+---+---+---+---+          +---+---+---+---+
Y1 | B | A | D | C |       Y1 | B | D | E | C |
+---+---+---+---+          +---+---+---+---+
Y2 | E | F | G | H |       Y2 | F | A | G | H |
+---+---+---+---+          +---+---+---+---+
Y3 | F | E | H | G |       Y3 | G | F | H | E |
+---+---+---+---+          +---+---+---+---+
the relative positions:    the relative positions:
A:(1, 1),  B:(-1, 1)       A:(1, 2),  B:(-1, 1)
C:(1, 1),  D:(-1, 1)       C:(1, 1),  D:(-2, 1)
E:(1, 1),  F:(-1, 1)       E:(1, 2),  F:( 1, 1)
G:(1, 1),  H:(-1, 1)       G:(-2, 1), H:(-1, 1)


Arrangements of the same pattern should be counted only once. Two board arrangements are said to have the same pattern if they are obtained from each other by repeatedly making any two pairs exchange their positions. For example, the following two arrangements have the same pattern:



X0  X1  X2  X3           X0  X1  X2  X3
+---+---+---+---+        +---+---+---+---+
Y0 | H | G | F | E |     Y0 | A | B | C | D |
+---+---+---+---+        +---+---+---+---+
Y1 | G | E | D | F |     Y1 | B | D | E | C |
+---+---+---+---+        +---+---+---+---+
Y2 | C | H | B | A |     Y2 | F | A | G | H |
+---+---+---+---+        +---+---+---+---+
Y3 | B | C | A | D |     Y3 | G | F | H | E |
+---+---+---+---+        +---+---+---+---+


where (1) `A' and `H', (2) `B' and `G', (3) `C' and `F', and (4) `D' and `E' exchange their positions respectively.



Input

The input contains multiple data sets, each representing 4 relative positions. A data set is given as a line in the following format.

x1| y1 | x2| y2 | x3| y3 | x4| y4
---|---|---|---|---|---|---|---

The i-th relative position is given by (xi, yi). You may assume that the given relative positions are different from one another and each of them is one of the 24 candidates.

The end of input is indicated by the line which contains a single number greater than 4.

Output

For each data set, your program should output the total number of board arrangements (or more precisely, the total number of patterns).

Each number should be printed in one line. Since your result is checked by an automatic grading program, you should not insert any extra characters nor lines on the output.

Examples

Input




Output




Input

-2 1 -1 1 1 1 1 2
1 0 2 1 2 2 3 3
5


Output

2
15

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class Main{
    
    int HEIGHT = 4;
    int WIDTH = 4;
    int[][] relationXY;

    void run(){
        Scanner sc = new Scanner(System.in);
        //int[][] temp = { { -2, 1},{ -1, 1},{ 1, 1},{ 1, 2}};
        
        while(true){
            int[][] temp = new int[4][2];
            int x = sc.nextInt();
            if(x > 4){
                break;
            }
            int y = sc.nextInt();
            temp[0][0] = x;
            temp[0][1] = y;
            for(int i = 1;i < 4;i++){
                temp[i][0] = sc.nextInt();
                temp[i][1] = sc.nextInt();
            }
            relationXY = temp;
            boolean[][] visited = new boolean[HEIGHT][WIDTH];
            System.out.println(dfs(visited,HEIGHT*WIDTH,0));
        }
    }
    int dfs(boolean[][] visited,int remain,int next){
        /*
        System.out.println("remain "+remain);
        for(int i = 0;i < HEIGHT;i++){
            for(int ii = 0;ii < WIDTH;ii++){
                System.out.print(visited[i][ii]? 1: 0);
            }
            System.out.println();
        }
        */
        if(remain == 0){
            return 1;
        }
        if(next >= HEIGHT*WIDTH){
            return 0;
        }

        int count = 0;

        int y = next / HEIGHT;
        int x = next % WIDTH;
        if( visited[y][x]){
            count+=dfs(visited,remain,next+1);
        }
        else{
            for(int i = 0;i < relationXY.length;i++){
                int rx = x + relationXY[i][0];
                int ry = y + relationXY[i][1];
                if(rx < 0 || WIDTH <= rx || ry < 0 || HEIGHT <= ry){
                    continue;
                }
                if(!visited[ry][rx]){
                    visited[y][x] = true;
                    visited[ry][rx] = true;
                    count += dfs(visited,remain-2,next+1);
                    visited[y][x] = false;
                    visited[ry][rx] = false;
                }
            }
        }

        return count;
    }
    public static void main(String[] args) {
        new Main().run();
    }
}