Shortening codes

John learns to read the time from a clock. The hardest cases are when both hands overlap. He would like to know how many times this troublesome situation will take place if he watches the clock from time A to time B.

Input

There is an unknown number of tests. Each test consists of one line which contains the time when John starts observing the clock and the time when he finishes (both in format hh:mm; 00:00 ≤ A,B ≤ 23:59). The observation lasts less than 24 hours.

Output

For each test the number of moments in which both hands will overlap, from time A to B. 

Example

Input:
00:00 23:59
22:00 02:00
13:05 13:06

Output:
22
3
1