import static java.lang.System.err;

public class Main {
	public static void main(String[] args) {
		java.io.PrintWriter out = new java.io.PrintWriter(System.out);
		new Main(out);
		out.flush();
		err.flush();
	}

	/*
	 * 考察
	 * 連結パーツを作りたい
	 *
	 * 124
	 * 03x
	 * 03x
	 * 011
	 * 232
	 * 44x
	 * を始点パーツ
	 * x13
	 * 02x
	 * 12x
	 * x00
	 * x21
	 * 33x
	 * を接続パーツ
	 * x24
	 * 013
	 * 213
	 * x00
	 * x12
	 * 443
	 * を終点パーツとすると、5+2xは作れる
	 * 3665
	 * 244x
	 * 211x
	 * 1000
	 * 2334
	 * 455x
	 * で6+2xも作れる
	 * あ、勝ちました
	 * 1だと100011で良い、2は不可能が示せるので終了
	 */
	public Main(java.io.PrintWriter out) {
		try (java.util.Scanner sc = new java.util.Scanner(System.in)) {
			int N = sc.nextInt();
			int[][] joint = { { -1, 1, 3 }, { 0, 2, -1 }, { 1, 2, -1 }, { -1, 0, 0 }, { -1, 2, 1 }, { 3, 3, -1 } };
			int[][] last = { { -1, 2, 4 }, { 0, 1, 3 }, { 2, 1, 3 }, { -1, 0, 0 }, { -1, 1, 2 }, { 4, 4, 3 } };
			if (N == 1) {
				out.println("0\n1\n1\n1\n0\n0");
			} else if (N == 2) {
				out.println(-1);
			} else if (N % 2 == 1) {
				int[][] first = { { 1, 2, 4 }, { 0, 3, -1 }, { 0, 3, -1 }, { 0, 1, 1 }, { 2, 3, 2 }, { 4, 4, -1 } };
				if (N == 3) {
					for (int[] i : first) {
						for (int j : i) {
							if (j == -1) j = 9;
							out.print(j);
						}
						out.println();
					}
					return;
				}
				int[][] ans = new int[6][N];
				int line = 0, add = 0;
				for (int y = 0;y < 6;++ y) {
					for (int x = 0;x < 3;++ x) {
						if (first[y][x] != -1) ans[y][x + line] = first[y][x];
					}
				}
				line += 2;
				add += 5;
				while(line + 3 != N) {
					for (int y = 0;y < 6;++ y) {
						for (int x = 0;x < 3;++ x) {
							if (joint[y][x] != -1) ans[y][x + line] = (joint[y][x] + add) % 10;
						}
					}
					line += 2;
					add += 5;
				}
				for (int y = 0;y < 6;++ y) {
					for (int x = 0;x < 3;++ x) {
						if (last[y][x] != -1) ans[y][x + line] = (last[y][x] + add) % 10;
					}
				}
				for (int[] i : ans) {
					for (int j : i) out.print(j);
					out.println();
				}
				return;
			} else {
				int[][] first = {{3, 6, 6, 5}, {2, 4, 4, -1}, {2, 1, 1, -1}, {1, 0, 0, 0}, {2, 3, 3, 4}, {6, 5, 5, -1}};
				if (N == 4) {
					for (int[] i : first) {
						for (int j : i) {
							if (j == -1) j = 9;
							out.print(j);
						}
						out.println();
					}
					return;
				}
				int[][] ans = new int[6][N];
				int line = 0, add = 0;
				for (int y = 0;y < 6;++ y) {
					for (int x = 0;x < 4;++ x) {
						if (first[y][x] != -1) ans[y][x + line] = first[y][x];
					}
				}
				line += 3;
				add += 7;
				while(line + 3 != N) {
					for (int y = 0;y < 6;++ y) {
						for (int x = 0;x < 3;++ x) {
							if (joint[y][x] != -1) ans[y][x + line] = (joint[y][x] + add) % 10;
						}
					}
					line += 2;
					add += 5;
				}
				for (int y = 0;y < 6;++ y) {
					for (int x = 0;x < 3;++ x) {
						if (last[y][x] != -1) ans[y][x + line] = (last[y][x] + add) % 10;
					}
				}
				for (int[] i : ans) {
					for (int j : i) out.print(j);
					out.println();
				}
				return;
			}
		}
	}
}