You visit a doctor on a date given in the format $yyyy:mm:dd$. Your doctor suggests you to take pills every alternate day starting from that day. You being a forgetful person are pretty sure won’t be able to remember the last day you took the medicine and would end up in taking  the medicines on wrong days. 
So you come up with the idea of taking medicine on the dates whose day is odd or even depending on whether $dd$ is odd or even. Calculate the number of pills you took on right time before messing up for the first time.
-----Note:-----
Every year that is exactly divisible by four is a leap year, except for years that are exactly divisible by 100; the centurial years that are exactly divisible by 400 are still leap years. For example, the year 1900 is not a leap year; the year 2000 is a leap year.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- Each testcase contains of a single line of input, in the format $yyyy:mm:dd$
-----Output:-----
For each testcase, output in a single line the required answer.
-----Constraints-----
- $ 1 \leq T \leq 1000 $
- $ 1900 \leq yyyy \leq 2038 $
- $yyyy:mm:dd$ is a valid date
-----Sample Input:-----
1
2019:03:31
-----Sample Output:-----
1
-----EXPLANATION:-----
You can take pill on the right day only on 31st March. Next you will take it on 1st April which is not on the alternate day.
for i in range(int(input())):
 li = input().split(':')
 y = int(li[0])
 m = int(li[1])
 d = int(li[2])
 if m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12:
  count = (31 - d)//2 + 1
 elif m == 4 or m == 6 or m == 9 or m == 11:
  count = (30 + 31 - d)//2 + 1
 else:
  if (y % 4 == 0 and y % 100 != 0) or y % 400 == 0:
   count = (29 - d)//2 + 1
  else:
   count = (28 + 31 - d)//2 + 1
 print(count)
for i in range(int(input())):
 li = input().split(':')
 y = int(li[0])
 m = int(li[1])
 d = int(li[2])
 if m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12:
  count = (31 - d)//2 + 1
 elif m == 4 or m == 6 or m == 9 or m == 11:
  count = (30 + 31 - d)//2 + 1
 else:
  if (y % 4 == 0 and y % 100 != 0) or y % 400 == 0:
   count = (29 - d)//2 + 1
  else:
   count = (28 + 31 - d)//2 + 1
 print(count)