A. Forks
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A shipment of $$$5$$$ sets of forks has been delivered to Viktor's store. Each set consists of a box containing exactly $$$5$$$ forks.

Before displaying the sets for sale, it is necessary to find out the exact number of different sets of forks in order to free up space for them on the shelf. Each fork can be characterized by a single integer $$$k$$$ — the number of tines.

Forks are considered identical if they have the same number of tines. Two sets $$$a$$$ and $$$b$$$ are considered the same if for every $$$k$$$, the number of forks with $$$k$$$ tines in set $$$a$$$ matches the number of forks with $$$k$$$ tines in set $$$b$$$.

Help Viktor determine the number of different sets.

Input

Each of the $$$5$$$ lines contains $$$5$$$ integers — the number of tines. Each line represents a separate set of forks. All numbers in the input are positive integers not exceeding $$$100$$$.

Output

Output a single integer — the number of different sets.

Examples
Input
1 1 7 1 1
1 7 1 7 1
7 1 1 1 7
7 7 7 7 7
7 1 1 1 7
Output
3
Input
1 1 2 2 1
1 2 3 1 1
2 3 1 1 1
1 2 3 1 1
1 1 2 2 1
Output
2
Note

In the first example, the sets are grouped as follows: (1), (2, 3, 5), (4). In the second example: (1, 5), (2, 3, 4).