codeforces round #419 A. Karen and Morning

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<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 char s[];int n;
 bool check()
 {
     int l=,r=n;
     while(l<r)
     {
         if(s[l]!=s[r])return false;
         l++;r--;
     }
     return true;
 }
 int main()
 {
     scanf("%s",s+);
     n=strlen(s+);
     int ans=;
     while()
     {
         if(check())
         {
             printf("%d",ans);
             return ;
         }
         s[]++;ans++;
         if(s[]==''+)s[]='',s[]++;
         if(s[]=='')s[]='',s[]++;
         if(s[]==''+ && s[]<='')s[]++,s[]='';
         if(s[]=='' && s[]=='')s[]='',s[]='';
     }
     return ;
 }