Apart from Nian, there is a daemon named Sui, which terrifies children and causes them to become sick. Parents give their children money wrapped in red packets and put them under the pillow, so that when Sui tries to approach them, it will be driven away by the fairies inside.

Big Banban is hesitating over the amount of money to give out. He considers loops to be lucky since it symbolizes unity and harmony.

He would like to find a positive integer n not greater than 1018, such that there are exactly k loops in the decimal representation of n, or determine that such n does not exist.

A loop is a planar area enclosed by lines in the digits' decimal representation written in Arabic numerals. For example, there is one loop in digit 4, two loops in 8 and no loops in 5. Refer to the figure below for all exact forms.

<image>

Input

The first and only line contains an integer k (1 ≤ k ≤ 106) — the desired number of loops.

Output

Output an integer — if no such n exists, output -1; otherwise output any such n. In the latter case, your output should be a positive decimal integer not exceeding 1018.

Examples

Input

2


Output

462

Input

6


Output

8080

		 
		    		import java.awt.List;
		    		import java.io.*;
		import java.math.BigInteger;
		import java.util.*;
		
		    		
		    		
		    		/*
		    		 * 
		    		 * daiict
		    		 *
		    		 * 
		    		 * 
		    		 */
		    		
		    		
		    		public class prac {
		    			FastScanner in;
		    			PrintWriter out;
		    		
		    			static ArrayList[] adj;
		    			static ArrayList[] aadj;
		    		    static int last;
		    			static int n;
		    			static int m;
		    			
		    			static int[] dp1;
		    			static int[] dp2;
		    			static int color[];
		    			static int visited[];
		    			static int[] arr;
		    			static long[] brr;
		    			static double ans;
		    			static int array[];
		    			static int start[];
		    			static int finish[];
		    			static int pref[];
		    			static int tree[];
		    			static int maxval = 32;
		    		
		    			static int ttt[];
		    			static int sum = 0;
		    			static String s;
		    		
		    			static int cc = 0;
		    			static long min = Long.MAX_VALUE;
		    			
		    		//for dfs do not delete
		    			static int dir[][] ={{1,0},{0,1},{0,-1},{-1,0}};
		    			
		    		
		    			static long[] seg;
		    			static long count = 1;
		    			static long mod = (long)1e9 + 7;
		    	
		    			static int parent[];
		    			static int size[];
		    			
		    		    static int[] l;
		    		    static int[] r;
		    		    static int[] next;
		    		    static int[] cnt;
		    		    static int[] block;
		    		    
		    			static HashSet<String> set;
		    			static HashSet<String> set2;
		    			
		    			static int low[];
		    			static int disc[];
		    			static int time;
		    			static int acn[];
		    			
		    			static class Pair implements Comparable<Pair>
		    		    {
		    				int x;int y;
		    				
		    		        Pair(int l, int m) {
		    		          
		    		        	this.x = l;
		    		            this.y = m;
		    		          
		    		        }
		    		        
		    		        public int compareTo(Pair p) {
		    		      
		    		        	
		    		            if (this.x == p.x) {
		    		                return (int)(this.y-p.y);
		    		            }
		    		            return (int)(this.x - p.x);
		    		        }
		    		        
		    		        public String toString(){
		    		        	return x + " " + y;
		    		        }
		    		        
		    		        public boolean equals(Object o){
		    		        	if(o instanceof Pair){
		    		        		Pair a = (Pair)o;
		    		        		
		    		        		return this.x == a.x;
		    		        	}
		    		        	
		    		        	return false;
		    		        }
		    		        
		    		        public int hashCode(){
		    		        	return new Long(x).hashCode()*31 + new Long(y).hashCode();
		    		        }
		    		    
		    		    }
		    		    
		    			
		    			public static int gcd(int a, int b) {
		    				if (b == 0) return a;
		    				return gcd(b, a%b);
		    			}
		    	
		    			void build(int n) {  // build the tree
		  				  for (int i = n - 1; i > 0; --i) seg[i] = seg[i<<1]+seg[i<<1|1];
		  				}
	
		  			public static void modify(int p, long val,int n) {  // set value at position p
		  				  for (seg[p += n] = val; p > 1; p >>= 1) seg[p>>1] = seg[p] + seg[p^1];
		  				}
	
		  				long query(int l, int r,int n) {  // sum on interval [l, r)
		  				  long res = 0;
		  				  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
		  				    if ((l&1) == 1) res += seg[l++];
		  				    if ((r&1) == 1) res += seg[--r];
		  				  }
		  				  return res;
		  				}
		    				
//		    			public static void update(int x,int val){
//		    				while(x<=maxval){
//		    					tree[x] += val;
//		    					x = (x&-x);
//		    				}
//		    			}
		    			
		    			public static int read(int idx){
		    				int sum = 0;
		    				
		    				while(idx>= 0){
		    					sum += tree[idx];
		    					idx -= (idx&(-idx));
		    				}
		    				
		    				return sum;
		    			}
		    			
		    			public static int find(int i){
		    				if(parent[i] != i){
		    					return find(parent[i]);
		    				}
		    				
		    				return i;
		    			}
		    			
		    			public static void union(int a,int b){
		    				int x = find(a);
		    				int y = find(b);
		    				
		    				if(x!=y){
		    					if(size[x] > size[y]){
		    						size[x] += size[y];
		    						parent[y] = x;
		    					}else{
		    						size[y] += size[x];
		    						parent[x] = y;
		    				}
		    				}
		    			}
		    			
		    			
		    			
		    		    void solve() throws NumberFormatException,InputMismatchException, IOException {
		    		 
		    		    
		    		    	//Scanner in = new Scanner(System.in);

		    		    	int k=in.nextInt();
		    				
		    				if(k>36)
		    					System.out.println(-1);
		    				else if(k==0)
		    					System.out.println(1);
		    				else if(k==1)
		    					System.out.println(6);
		    				else{
		    					if(k<=18){
		    						while(k-->0){
		    							System.out.print(6);
		    						}
		    					}else{
		    						while(k>1){
		    							System.out.print(8);
		    							k-=2;
		    						}
		    						if(k>0)
		    							System.out.println(6);
		    					}
		    				}
		    		    	
		    		    }
		    		    
		    		    
		    		    static void call(int i){
		    		    	
		    		    	//System.out.println(i);
		    		    	
		    		    	visited[i] = 1;
		    		    	time++;
		    		    	disc[i] = time;
		    		    	low[i] = time;
		    		    	
		    		    	for(int j = 0;j<adj[i].size();j++){
		    		    		if(visited[(int)adj[i].get(j)] == 0){
		    		    			acn[(int)adj[i].get(j)] = i;
		    		    			call((int)adj[i].get(j));
		    		    			
		    		    			low[i] = Math.min(low[i], low[(int)adj[i].get(j)]);
		    		    			
		    		    			if(low[(int)adj[i].get(j)] > disc[i] ){
		    		    				int temp = (int)adj[i].get(j);
		    		    				union(temp,i);	
		    		    				System.out.println(temp + " " + i);
		    		    			}
		    		    		}else if((int)adj[i].get(j) != acn[i]){
		    		    			low[i] = Math.min(low[i], disc[(int)adj[i].get(j)]);
		    		    		}
		    		    	}
		    		    	
		    		    	
		    		    }
		    		    
		    		    
		    		    static void update(int idx, int b){
		    		        int j = block[idx];
		    		        arr[idx] = b;
		    		        
		    		        for(int i = r[j]; i >= l[j]; i--){
		    		            int k = (int) (i + arr[i]);
		    		            if(k >= n){
		    		                next[i] = i;
		    		                cnt[i] = 1;
		    		                continue;
		    		            }
		    		            if(block[k] > block[i]){
		    		                next[i] = k;
		    		                cnt[i] = 1;
		    		            }
		    		            else{
		    		                next[i] = next[k];
		    		                cnt[i] = cnt[k] + 1;
		    		            }
		    		        }
		    		        
		    		    }
		    		    
		    		    
		    		    
		    		    static void get(int idx){
		    		        if(next[idx] == idx){
		    		            last = idx;
		    		            ans = 1;
		    		            return;
		    		        }
		    		        int c = 0;
		    		        while(true){
		    		            int j = next[idx];
		    		            if(block[j] == block[idx]){
		    		               c += cnt[idx];
		    		               last = next[idx];
		    		               break;
		    		            }
		    		            else{
		    		                c += cnt[idx];
		    		                idx = next[idx];
		    		            }
		    		        }
		    		        
		    		        ans = c;
		    		    }
		    	
		    		    
		    		    static private String Frac(double x){
		    		        if (x < 0){
		    		            return "-" + Frac(-x);
		    		        }
		    		        double tolerance = 1.0E-18;
		    		        double h1=1; double h2=0;
		    		        double k1=0; double k2=1;
		    		        double b = x;
		    		        do {
		    		            double a = Math.floor(b);
		    		            double aux = h1; h1 = a*h1+h2; h2 = aux;
		    		            aux = k1; k1 = a*k1+k2; k2 = aux;
		    		            b = 1/(b-a);
		    		        } while (Math.abs(x-h1/k1) > x*tolerance);

		    		        return h1+" "+k1;
		    		    }
		    		    
		    		    public static long invcount(int arr[]){
		    		    	if(arr.length<2){
		    		    		return 0;
		    		    	}
		    		    	
		    		    	int mid = (arr.length + 1)/2;
		    		    	
		    		    	int left[] = Arrays.copyOfRange(arr, 0,mid);
		    		    	int right[] = Arrays.copyOfRange(arr, mid, arr.length);
		    		    	
		    		    	return invcount(left)+invcount(right)+merge(arr,left,right);
		    		    	
		    		    }	    		    
		    		    public static long merge(int arr[],int left[],int right[]){
		    		    	long count = 0;
		    		    	
		    		    	int i = 0;
		    		    	int j = 0;
		    		    	
		    		    	while(i<left.length || j < right.length){
		    		    		
		    		    		if(i == left.length){
		    		    			arr[i+j] = right[j];
		    		    			j++;
		    		    		}else if(j == right.length){
		    		    			arr[j+i] = left[i];
		    		    			i++;
		    		    		}else{
		    		    			if(left[i] <= right[j]){
		    		    				arr[i+j] = left[i];
		    		    				i++;
		    		    			}else{
		    		    				arr[i+j] = right[j];
		    		    				j++;
		    		    				count += left.length-i;
		    		    			}
		    		    		}
		    		    		
		    		    	}
		    		    	
		    		    	return count;
		    		    }
		    		    /**
		    		     * 
		    		     * @param div
		    		     * @param left
		    		     * @param right
		    		     * @param value
		    		     * @return the smallest index i which a[i] >= value in range [left, right) if exists, otherwise return -1
		    		     */
		    		    int ff(int[] div, int left, int right, int value) {
		    		        int low = left;
		    		        int high = right;
		    		        
		    		        if(value > div[right-1]){
		    		        	return left;
		    		        }
		    		        
		    		        while (low != high) {
		    		            int mid = (low + high) / 2;
		    		            if (div[mid] < value) {
		    		                low = mid + 1;
		    		            } else {
		    		                high = mid;
		    		            }
		    		        }
		    		        if (low == right) {
		    		            return low;
		    		        }
		    		        return low;
		    		    } 
		    		   
		    		    /**
		    		     * 
		    		     * @param div
		    		     * @param left
		    		     * @param right
		    		     * @param value
		    		     * @return greatest index i which a[i] <= value in range [left, right) if exists, otherwise return a number out of [left, right)
		    		     */
		    		    int ffff(int[] div, int left, int right, int value) {
		    		        
		    		    	if(value < div[left]){
		    		    		return right-1;
		    		    	}
		    		    	
		    		    	while (left != right) {
		    		            int mid = (left + right) >> 1;
		    		            if (div[mid] <= value) {
		    		                left = mid + 1;
		    		            } else {
		    		                right = mid;
		    		            }
		    		        }
		    		        if (left < 0) {
		    		            left *= -1;
		    		        }
		    		        return --left;
		    		    }
			    
		    		   
		    		  
		    		
		    		    public static String reverse(String s){
		    		    	
		    		    	String ans = "";
		    		    	
		    		    	for(int i = s.length()-1;i>=0;i--){
		    		    		ans += s.charAt(i);
		    		    	}
		    		    	
		    		    	return ans;
		    		    	
		    		    }
		    			
		    			
		    		    
		    		 
		    		    public static long sum(long x){
		    		    	return x<10?x:x%10 + sum(x/10);
		    		    }
		    			
		    			public static long gcd(long x, long y) {
		    				if (x == 0)
		    					return y;
		    				else
		    					return gcd( y % x,x);
		    			}
		    			static long inv(long x , long mod)
		    			{
		    				long r,y;
		    				for(r=1,y=mod-2;y!=0;x=x*x%mod,y>>=1)
		    				{
		    					if((y&1)==1)
		    						r=r*x%mod;
		    				
		    				}
		    				return r;
		    			}
		    			
		    			public static long pow(long x,long y,long n){
		    				if(y==0)
		    					return 1%n;
		    				if(y%2==0){
		    					long z=pow(x,y/2,n);
		    					return (z*z)%n;
		    				}
		    				return ((x%n)*pow(x,y-1,n))%n;
		    			}
		    			
		    			
		    			
		    			
		    			public static boolean isPrime(long a) {
		    				// Corner cases
		    				if (a <= 1)
		    					return false;
		    				if (a <= 3)
		    					return true;
		    		 
		    				// This is checked so that we can skip 
		    				// middle five numbers in below loop
		    				if (a % 2 == 0 || a % 3 == 0)
		    					return false;
		    		 
		    				for (long i = 5; i * i <= a; i = i + 6)
		    					if (a % i == 0 || a % (i + 2) == 0)
		    						return false;
		    		 
		    				return true;
		    			}
		    			
		    		
		    			void run() throws NumberFormatException, InputMismatchException,IOException {
		    				in = new FastScanner();
		    				out = new PrintWriter(System.out);
		    		
		    				solve();
		    		
		    				out.close();
		    			}
		    		
		    			class FastScanner {
		    				BufferedReader br;
		    				StringTokenizer st;
		    		
		    				public FastScanner() {
		    					br = new BufferedReader(new InputStreamReader(System.in));
		    				}
		    		
		    				String next() {
		    					while (st == null || !st.hasMoreTokens()) {
		    						try {
		    							st = new StringTokenizer(in.br.readLine());
		    						} catch (IOException e) {
		    							// TODO Auto-generated catch block
		    							e.printStackTrace();
		    						}
		    					}
		    					return st.nextToken();
		    				}
		    		
		    				int nextInt() {
		    					return Integer.parseInt(next());
		    				}
		    		
		    				long nextLong() {
		    					return Long.parseLong(next());
		    				}
		    		
		    				double nextDouble() {
		    					return Double.parseDouble(next());
		    				}
		    			}
		    			
		    			
		    			
		    			
		    		 
		    		
		    			public static void main(String[] args) throws NumberFormatException,InputMismatchException, IOException {
		    				new prac().run();
		    			}
		    		}
		    		class Node{
		    			int a;
		    			int b;
		    			public Node(int i, int j) {
							this.a = i;
							this.b = j;
							
						}
					
		    			
		    		}
		    		
		    		class MyComp implements Comparator<String>{
		    		    
		    			int c = 0;
		    			
		    			MyComp(int d){
		    				c = d;
		    			}
		    			
		    			@Override
		    			public int compare(String a,String b) {
		    				
		    				// < == -1
		    				
		    				String arr[] = a.split(" ");
		    				String brr[] = b.split(" ");
		    				
		    				return arr[c].compareTo(brr[c]);
		    				
		    				
		    			}
		
		    			
		    		}
		    		
		    		class MyComp2 implements Comparator<Node>{
		    		    
		    		
		    			
		    			@Override
		    			public int compare(Node a,Node b) {
		    				
		    				// < == -1
		
		    				
		    				if(a.b > b.b){
		    					return -1;
		    				}else{
		    					return 1;
		    				}
		    				
		    				
		    			}
		
		    			
		    		}
