Problem: We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with tiling a rectangular field with dominoes.

You are given a 4 × n rectangular field, that is the field that contains four lines and n columns. You have to find for it any tiling by 1 × 2 dominoes such that each of the n - 1 potential vertical cuts along the grid lines intersects at least one domino, splitting it in two. No two dominoes in the sought tiling should overlap, each square of the field should be covered by exactly one domino. It is allowed to rotate the dominoes, that is, you can use 2 × 1 as well as 1 × 2 dominoes.

Write a program that finds an arbitrary sought tiling. 

Input

The input contains one positive integer n (1 ≤ n ≤ 100) — the number of the field's columns.

Output

If there's no solution, print "-1" (without the quotes). Otherwise, print four lines containing n characters each — that's the description of tiling, where each vertical cut intersects at least one domino. You should print the tiling, having painted the field in no more than 26 colors. Each domino should be painted a color. Different dominoes can be painted the same color, but dominoes of the same color should not be side-neighbouring. To indicate colors you should use lowercase Latin letters. Print any of the acceptable ways of tiling.

Examples

Input

4


Output

yyzz
bccd
bxxd
yyaa

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Main implements Runnable {
	private BufferedReader in;
	private PrintWriter out;
	private StringTokenizer st;
	
	private void eat(String line) {
		st = new StringTokenizer(line);
	}
	
	private String next() throws IOException {
		while (!st.hasMoreTokens()) {
			String line = in.readLine();
			if (line == null)
				return null;
			eat(line);
		}
		return st.nextToken();
	}
	
	private int nextInt() throws IOException {
		return Integer.parseInt(next());
	}
	
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(new OutputStreamWriter(System.out));
			eat("");
			
			go();
			
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(-1);
		}
	}
	
	public static void main(String[] args) {
		new Thread(new Main()).start();
	}
	
	public void go() throws IOException {
		int n = nextInt();
		String[] result = new Algorithm().solve(n);
		if (result == null)
			out.println(-1);
		else
			for (String r : result)
				out.println(r);
	}
}

class Algorithm {
	public final static int ROWS = 4;
	public final static int STATES = 1 << ROWS;
	
	static boolean[][] canMove = new boolean[STATES][STATES];
	
	static {
		for (int u = 0; u < (1 << ROWS); ++u)
			go(0, u, u, 0);
	}
	
	static void go(int bit, int initial, int u, int v) {
		if (bit == ROWS)
			canMove[initial][v] = true;
		else if ((u & (1 << bit)) == 0) {
			go(bit + 1, initial, u | (1 << bit), v | (1 << bit));
			if (bit + 1 < ROWS && (u & (1 << bit + 1)) == 0)
				go(bit + 2, initial, u | (1 << bit) | (1 << bit + 1), v);
		} else
			go(bit + 1, initial, u, v);
	}
	
	private char nextChar(char cur) {
		if (cur == 'z')
			return 'a';
		else
			return (char) (cur + 1);
	}
	
	private String[] makeResult(int n, int[][] parentMask) {
		char[][] buffer = new char[ROWS][n];
		
		int prevMask = 0;
		char curChar = 'a';
		for (int position = n - 1; position >= 0; --position) {
			int curMask = parentMask[position + 1][prevMask];
			int bit = 0;
			while (bit < ROWS) {
				if ((curMask & (1 << bit)) != 0) {
					buffer[bit][position] = buffer[bit][position - 1] = curChar = nextChar(curChar);
					bit += 1;
				} else if (buffer[bit][position] == 0) {
					buffer[bit][position] = buffer[bit + 1][position] = curChar = nextChar(curChar);
					bit += 2;
				} else
					++bit;
			}
			prevMask = curMask;
		}
		String[] result = new String[ROWS];
		for (int i = 0; i < ROWS; ++i)
			result[i] = new String(buffer[i]);
		return result;
	}
	
	public String[] solve(int n) {
		boolean[][] used = new boolean[n + 1][STATES];
		int[][] parentMask = new int[n + 1][STATES];
		Queue<Integer> queue = new ArrayDeque<Integer>();
		
		parentMask[0][0] = -1;
		used[0][0] = true;
		queue.add(0);
		queue.add(0);
		
		while (!queue.isEmpty()) {
			int position = queue.poll();
			int mask = queue.poll();
			if (position == n) {
				if (mask == 0)
					return makeResult(n, parentMask);
				else
					continue;
			}
			if (mask == 0 && position != 0)
				continue;
			for (int nmask = 0; nmask < STATES; ++nmask)
				if (canMove[mask][nmask] && !used[position + 1][nmask]) {
					used[position + 1][nmask] = true;
					parentMask[position + 1][nmask] = mask;
					queue.add(position + 1);
					queue.add(nmask);
				}
		}
		
		return null;
	}
}