Chilly Willy loves playing with numbers. He only knows prime numbers that are digits yet. These numbers are 2, 3, 5 and 7. But Willy grew rather bored of such numbers, so he came up with a few games that were connected with them.

Chilly Willy wants to find the minimum number of length n, such that it is simultaneously divisible by all numbers Willy already knows (2, 3, 5 and 7). Help him with that.

A number's length is the number of digits in its decimal representation without leading zeros.

Input

A single input line contains a single integer n (1 ≤ n ≤ 105).

Output

Print a single integer — the answer to the problem without leading zeroes, or "-1" (without the quotes), if the number that meet the problem condition does not exist.

Examples

Input

1


Output

-1


Input

5


Output

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

public class Main{
  static class Solver{
    public void solve(){
      int n = nextInt();
      final BigInteger b210 = BigInteger.valueOf(210);
      BigInteger ans = BigInteger.TEN.pow(n - 1).divide(b210).multiply(b210);
      if (ans.toString().length() < n){
        ans = ans.add(b210);
      }
      if(ans.compareTo(BigInteger.ZERO) == 0 || ans.toString().length() != n){
        printf("-1\n");
      }
      else{
        printf("%d\n", ans);
      }
    }

    Solver(){
      tokens = null;
      reader = new BufferedReader(new InputStreamReader(System.in), 1 << 15);
      out = new PrintWriter(System.out);
    }

    public void close(){ out.close(); } // imprime os dados

    PrintWriter out;
    BufferedReader reader;
    StringTokenizer tokens;

    void settoken(){
      while(tokens == null || !tokens.hasMoreTokens()){
        try{
          tokens = new StringTokenizer(reader.readLine());
        }
        catch(IOException e){
          throw new RuntimeException(e);
        }
      }
    }

    String next(){
      settoken();
      return tokens.nextToken();
    }

    String nextLine(){
      settoken();
      return tokens.nextToken("\n");
    }

    int nextInt() { return Integer.parseInt(next()); }
    long nextLong() { return Long.parseLong(next()); }
    double nextDouble() { return Double.parseDouble(next()); }

    void printf(String s, Object... o) { out.printf(s, o); }
  }

  public static void main(String[] args){
    Solver s = new Solver();
    s.solve();
    s.close();
  }
}
