#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <fstream>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
/*
notes:
int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string
vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));
{if statement} ? {truth value} : {false value}
set lower bound/upper bound:
// . . . m1 . . . d . . . . m2
auto m1_it = b.lower_bound(d);
advance(m1_it, -1);
m1 = *m1_it;
m2 = *b.upper_bound(d);
#ifdef LOCAL
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
constexpr auto lcm(auto x, auto... xs)
{
return ((x = std::lcm(x, xs)), ...);
}
std::gcd(int a, int b)
*/
typedef long long ll;
void solve() {
ll n;
cin >> n;
if(n == 1) {
cout << "-1";
return;
}
if(n % 3 == 0) {
for(ll i = 0; i < n; i++) {
cout << 1;
}
return;
}
if(n % 2 == 0) {
for(ll i = 0; i < n / 2; i++) {
cout << 15;
}
return;
}
n -= 3;
cout << "111";
for(ll i = 0; i < n / 2; i++) {
cout << 15;
}
}
int main()
{
std::ios_base::sync_with_stdio(false);
solve();
return 0;
}