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
import java.util.*;
import java.io.*;
public class Yan1A{
    static BufferedReader br;
    public static void main(String args[])throws Exception{
        br=new BufferedReader(new InputStreamReader(System.in));
        char ch[]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
        int n=toInt();

        if(n==1){
            System.out.println("a");
            System.out.println("a");
            System.out.println("b");
            System.out.println("b");

            return;
        }
        if(n==2){
            System.out.println("aa");
            System.out.println("bb");
            System.out.println("cc");
            System.out.println("dd");
            return;

        }
        String res[]=new String[4];
        Arrays.fill(res, "");

        if(n%2==0){
            String s11="aa";
            String s12="bb";
            String s21="cc";
            String s22="gg";
            String s31="ff";
            String s32="jj";

            boolean turn=false;
            for(int i=0;i<n/2;i++){
                if(turn){
                    res[0]+=s11;
                    turn=!turn;
                }
                else{
                    res[0]+=s12;
                    turn=!turn;
                }
            }
            for(int i=0;i<n/2-1;i++){
                if(turn){
                    res[1]+=s21;
                    res[2]+=s31;
                    turn=!turn;
                }
                else{
                    res[1]+=s22;
                    res[2]+=s32;
                    turn=!turn;
                }
            }
            res[1]="d"+res[1]+"p";
            res[2]="d"+res[2]+"p";
            res[3]=res[0];

            for(int j=0;j<4;j++){
                System.out.println(res[j]);
            }

        
        }
        else{
            String s11="aa";
            String s12="bb";
            String s21="cc";
            String s22="dd";
            boolean turn=false;
            for(int i=0;i<(n-1)/2;i++){
                if(turn){
                    res[0]+=s11;
                    res[1]+=s21;
                    turn=!turn;
                }
                else{
                    res[0]+=s12;
                    res[1]+=s22;
                    turn=!turn;
                }
            }
                res[0]="e"+res[0];
                res[1]="e"+res[1];
                StringBuilder sb1=new StringBuilder(res[0]);
                StringBuilder sb2=new StringBuilder(res[1]);

                res[2]=sb1.reverse().toString();
                res[3]=sb2.reverse().toString();
                for(int j=0;j<4;j++){
                    System.out.println(res[j]);
                }


            

        }

    }


    /****************************************************************/
    public static int[] toIntArray()throws Exception{
       String str[]=br.readLine().split(" ");
       int k[]=new int[str.length];
       for(int i=0;i<str.length;i++){
            k[i]=Integer.parseInt(str[i]);
       }
       return k;
    }
    public static int toInt()throws Exception{
       return Integer.parseInt(br.readLine());
    }
    public static long[] toLongArray()throws Exception{
       String str[]=br.readLine().split(" ");
       long k[]=new long[str.length];
       for(int i=0;i<str.length;i++){
            k[i]=Long.parseLong(str[i]);
       }
       return k;
    }
    public static long toLong()throws Exception{
       return Long.parseLong(br.readLine());
    }
    public static double[] toDoubleArray()throws Exception{
       String str[]=br.readLine().split(" ");
       double k[]=new double[str.length];
       for(int i=0;i<str.length;i++){
            k[i]=Double.parseDouble(str[i]);
       }
       return k;
    }
    public static double toDouble()throws Exception{
       return Double.parseDouble(br.readLine());
    }
    public static String toStr()throws Exception{
       return br.readLine();
    }
    public static String[] toStrArray()throws Exception{
       String str[]=br.readLine().split(" ");
       return str;
    }
    /****************************************************************/

}
