Giga Tower is the tallest and deepest building in Cyberland. There are 17 777 777 777 floors, numbered from  - 8 888 888 888 to 8 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 all lucky 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. 

Input

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

Output

Print the minimum b in a line.

Examples

Input

179


Output

1


Input

-1


Output

9


Input

18


Output

10

Note

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.
/**
 * Built using Sublime,Custom Python and Batch files
 * @author Siddhraj Sisodiya
 */

import java.io.*;
import java.util.*;
import java.math.*;

public class Main 
{
   public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        InputReader in = new InputReader(inputStream);
        Task solver = new Task(in);
        solver.solve();
    }

    static class Task
    {
        InputReader in;
        long m=1000000007;
        

        Task(InputReader in)
        {
            this.in=in;
        }

        public void solve()
        {
            int n=in.nextInt();
            String s=Integer.toString(n);
            int temp=n+1;
            while(!isEight(Integer.toString(temp)))
            {
                temp++;
            }
            System.out.println(temp-n);
        }
        private boolean isEight(String s)
        {
            for(int i=0;i<s.length();i++)
            {
                if(s.charAt(i)=='8')
                {
                    return true;
                }
            }
            return false;
        }
    }

    static class Pair
    {
        public int first;
        public int second;
        public Pair(int a,int b)
        {
            first=a;
            second=b;
        }
    }

    static class InputReader 
    {
        private boolean finished = false;

        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) 
        {
            this.stream = stream;
        }

        public int read() 
        {
            if (numChars == -1) 
            {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) 
            {
                curChar = 0;
                try 
                {
                    numChars = stream.read(buf);
                } catch (IOException e) 
                {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) 
                {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int peek() 
        {
            if (numChars == -1) 
            {
                return -1;
            }
            if (curChar >= numChars) 
            {
                curChar = 0;
                try 
                {
                    numChars = stream.read(buf);
                } catch (IOException e) 
                {
                    return -1;
                }
                if (numChars <= 0) 
                {
                    return -1;
                }
            }
            return buf[curChar];
        }

        public int nextInt() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do 
            {
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long nextLong() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do 
            {
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String nextString() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do 
            {
                if (Character.isValidCodePoint(c)) 
                {
                    res.appendCodePoint(c);
                }
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) 
        {
            if (filter != null) 
            {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) 
        {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private String readLine0() 
        {
            StringBuilder buf = new StringBuilder();
            int c = read();
            while (c != '\n' && c != -1) 
            {
                if (c != '\r') 
                {
                    buf.appendCodePoint(c);
                }
                c = read();
            }
            return buf.toString();
        }

        public String readLine() 
        {
            String s = readLine0();
            while (s.trim().length() == 0) 
            {
                s = readLine0();
            }
            return s;
        }

        public String readLine(boolean ignoreEmptyLines) 
        {
            if (ignoreEmptyLines) 
            {
                return readLine();
            } else 
            {
                return readLine0();
            }
        }

        public BigInteger readBigInteger() 
        {
            try 
            {
                return new BigInteger(nextString());
            } catch (NumberFormatException e) 
            {
                throw new InputMismatchException();
            }
        }

        public char nextCharacter() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            return (char) c;
        }

        public double nextDouble() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') 
            {
                if (c == 'e' || c == 'E') 
                {
                    return res * Math.pow(10, nextInt());
                }
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') 
            {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) 
                {
                    if (c == 'e' || c == 'E') 
                    {
                        return res * Math.pow(10, nextInt());
                    }
                    if (c < '0' || c > '9') 
                    {
                        throw new InputMismatchException();
                    }
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public boolean isExhausted() 
        {
            int value;
            while (isSpaceChar(value = peek()) && value != -1) 
            {
                read();
            }
            return value == -1;
        }

        public String next() 
        {
            return nextString();
        }

        public SpaceCharFilter getFilter() 
        {
            return filter;
        }

        public void setFilter(SpaceCharFilter filter) 
        {
            this.filter = filter;
        }

        public interface SpaceCharFilter 
        {
            public boolean isSpaceChar(int ch);
        }
        public int[] nextIntArray(int n)
        {
            int[] array=new int[n];
            for(int i=0;i<n;++i)array[i]=nextInt();
            return array;
        }
        public int[] nextSortedIntArray(int n)
        {
            int array[]=nextIntArray(n);
            Arrays.sort(array);
            return array;
        }
        public int[] nextSumIntArray(int n)
        {
            int[] array=new int[n];
            array[0]=nextInt();
            for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();
            return array;
        }
        public long[] nextLongArray(int n)
        {
            long[] array=new long[n];
            for(int i=0;i<n;++i)array[i]=nextLong();
            return array;
        }
        public long[] nextSumLongArray(int n)
        {
            long[] array=new long[n];
            array[0]=nextInt();
            for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();
            return array;
        }
        public long[] nextSortedLongArray(int n)
        {
            long array[]=nextLongArray(n);
            Arrays.sort(array);
            return array;
        }
    }
}