#include <bits/stdc++.h>
using namespace std;
const long long N = (2e5 + 5);
const long long MOD = 1e9 + 7;
const long long INF = 1e16;
const long long LOG = 29;
long long binpow(long long a, long long b) {
  a %= MOD;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  res %= MOD;
  return res;
}
void solve() {
  long long n;
  cin >> n;
  if (n == 1) {
    cout << "-1\n";
  } else {
    cout << 2;
    for (int i = 0; i < (n - 1); i++) {
      cout << 3;
    }
    cout << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
