#include <bits/stdc++.h>
using namespace std;
long long fact[1000005];
long long invFact[1000005];
void precompute() {
  fact[0] = fact[1] = 1;
  invFact[0] = invFact[1] = 1;
  for (long long i = 2; i < 1000005; i++) {
    fact[i] = (fact[i - 1] * i) % 1000000007;
  }
  for (long long i = 2; i < 1000005; i++) {
    invFact[i] =
        (1000000007 - 1000000007 / i) * invFact[1000000007 % i] % 1000000007;
  }
  for (long long i = 1; i < 1000005; i++) {
    invFact[i] = (invFact[i - 1] * invFact[i]) % 1000000007;
  }
}
long long comb(long long n, long long k) {
  return fact[n] * invFact[n - k] * invFact[k];
}
long long power(long long a, long long b) {
  long long res = 1;
  if (a == 0) {
    return a;
  }
  if (b == 0) {
    return 1;
  }
  a = a % 1000000007;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % 1000000007;
    }
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
void solve() {
  long long n;
  cin >> n;
  if (n == 1) {
    cout << -1 << "\n";
    return;
  }
  string ans = "2";
  while (n-- > 1) {
    ans += '3';
  }
  cout << ans << "\n";
}
signed main() {
  long long test;
  cin >> test;
  while (test--) {
    solve();
  }
}
