------
## 最终结论
```python
def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    
    t = int(data[0])
    results = []
    
    for i in range(t):
        n = int(data[i + 1])
        if n == 1:
            results.append(-1)
        elif n == 2:
            results.append(57)
        else:
            # Construct a number with non-zero digits that is not divisible by any of its digits
            result = '2' + '3' * (n - 1)  # Example: For n=3, it will create '233'
            results.append(int(result))
    
    for res in results:
        print(res)

if __name__ == "__main__":
    main()
```

This code reads multiple test cases and finds a number `s` for each case such that `s` has `n` digits, no digit is zero, and `s` is not divisible by any of its digits. The solution uses a simple strategy to construct such numbers. For `n > 2`, it constructs numbers like `233...3`, which are guaranteed not to be divisible by any of their digits. For `n = 2`, it uses the specific number `57` as a valid solution. If `n = 1`, there is no possible solution, so it returns `-1`.