A. Karen and Morning

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Karen is getting ready for a new school day!

It is currently hh:mm, given in a 24-hour format. As you know, Karen loves palindromes, and she believes that it is good luck to wake up when the time is a palindrome.

What is the minimum number of minutes she should sleep, such that, when she wakes up, the time is a palindrome?

Remember that a palindrome is a string that reads the same forwards and backwards. For instance, 05:39 is not a palindrome, because 05:39 backwards is 93:50. On the other hand, 05:50 is a palindrome, because 05:50 backwards is 05:50.

Input

The first and only line of input contains a single string in the format hh:mm (00 ≤  hh  ≤ 23, 00 ≤  mm  ≤ 59).

Output

Output a single integer on a line by itself, the minimum number of minutes she should sleep, such that, when she wakes up, the time is a palindrome.

Examples

input

05:39

output

11

input

13:31

output

0

input

23:59

output

1

Note

In the first test case, the minimum number of minutes Karen should sleep for is 11. She can wake up at 05:50, when the time is a palindrome.

In the second test case, Karen can wake up immediately, as the current time, 13:31, is already a palindrome.

In the third test case, the minimum number of minutes Karen should sleep for is 1 minute. She can wake up at 00:00, when the time is a palindrome.

解题说明：此题是一道回文字符判断题，可以采用遍历的方法，直到找到最近的回文数字。

#include<cstdio>#include<algorithm>#include<cstring>#include<cstdlib>#include<iostream>using namespace std;int main(void){int hour,min,h1,h2,m1,m2,i;scanf("%d:%d",&hour,&min);for(i=0; ;i++) {h2=hour%10;h1=hour/10;m2=min%10;m1=min/10;if(h1==m2 && h2==m1) {printf("%d\n",i);return 0;}if(hour==23 && min==59) {printf("%d\n",i+1);return 0;}min++;if(min>59) {min=0;hour++;}}return 0;}