Giga Tower is the tallest and deepest building in Cyberland. There are 17 777 777 777 floors, numbered from  - 8 888 888 888 to8 888 888 888. In particular, there is floor 0 between floor  - 1 and floor 1. Every day, thousands of tourists come to this place to enjoy the wonderful view.

In Cyberland, it is believed that the number "8" is a lucky number (that‘s why Giga Tower has 8 888 888 888 floors above the ground), and, an integer is lucky, if and only if its decimal notation contains at least one digit "8". For example, 8,  - 180, 808 are alllucky while 42,  - 10 are not. In the Giga Tower, if you write code at a floor with lucky floor number, good luck will always be with you (Well, this round is #278, also lucky, huh?).

Tourist Henry goes to the tower to seek good luck. Now he is at the floor numbered a. He wants to find the minimum positive integer b, such that, if he walks b floors higher, he will arrive at a floor with a lucky number.

The only line of input contains an integer a ( - 10⁹ ≤ a ≤ 10⁹).

Print the minimum b in a line.

For the first sample, he has to arrive at the floor numbered 180.

For the second sample, he will arrive at 8.

Note that b should be positive, so the answer for the third sample is 10, not 0.

代码：

 1 #include<stdio.h> 2 int function(int n) 3 { 4     int t,m=0; 5     while(n>0) 6     { 7         t=n%10; 8         if(t==8) 9         {10             m=1;11             break;12         }13         n=n/10;14 15     }16     return m;17 }18        int main()19 {20     int n,g,i;21     while(scanf("%d",&n)!=EOF)22     {23         for(i=1,n=n+1; i<20; i++)24         {25             if(n>=0)g=function(n);26             else g=function(-n);27             if(g)break;28             n++;29         }30         printf("%d\n",i);31     }32     return 0;33 }