#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (const auto &x : v) os << x << " ";
  return os << endl;
}
ll ceil_div(ll a, ll b) { return (a + b - 1) / b; }
void solve(int n) {
  if (n == 1) {
    cout << -1 << endl;
    return;
  }
  for (int i = 0; i < n; i++) {
    cout << (i == 0 ? 2 : 3);
  }
  cout << endl;
}
int main(int argc, char const *argv[]) {
  int T;
  cin >> T;
  for (int t = 0; t < T; t++) {
    int n;
    cin >> n;
    solve(n);
  }
  return 0;
}
