In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick.

He is too selfish, so for a given n he wants to obtain a string of n characters, each of which is either 'a', 'b' or 'c', with no palindromes of length 3 appearing in the string as a substring. For example, the strings "abc" and "abca" suit him, while the string "aba" doesn't. He also want the number of letters 'c' in his string to be as little as possible.

Input

The first line contains single integer n (1 ≤ n ≤ 2·105) — the length of the string.

Output

Print the string that satisfies all the constraints.

If there are multiple answers, print any of them.

Examples

Input

2


Output

aa


Input

3


Output

bba

Note

A palindrome is a sequence of characters which reads the same backward and forward.
import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class Main {
	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		Task t = new Task();
		t.solve(in, out);
		out.close();
	}

	static class Task {
		public void solve(InputReader in, PrintWriter out) throws IOException {
			long tStart = System.currentTimeMillis();
			// String arr1[] = {"hot","dog","cog","pot","dot"};
			// List<String> x = new ArrayList<String>();
			// for(String t:arr1) x.add(t);
			// System.out.println(findLadders("hot", "dog", x).toString());
//			int arr[][] = {
//					{1, 2},
//					{2, 3}, 
//					{6, 1},
//			};
//			int arr[][] = {
//					{9, 7},
//					{1, 9}, 
//					{3, 1},
//			};
//			int arr[][] = {
//					{100,100},
//					{200,100},
//			};
//			int arr[][] = {
//					{4,6},
//					{4,2},
//					{4,3}	
//			};
//			Dumper.print(fallingSquares(arr).toString());
			int n = in.nextInt();
			char[] arr = new char[n+3];
			arr[0] = 'o';
			arr[1] = 'p';
			arr[2] = 'q';
			char[] x = {'a','b','c'};
			int i=3;
			while(i<n+3) {
				for(int j=0;j<3;j++) {
					if(arr[i-2]!=x[j]) {
						arr[i++] = x[j];
						break;
					}
				}
			}
			String re = String.valueOf(arr, 3,n);
			Dumper.print(re);
			long tEnd = System.currentTimeMillis();
			long tDelta = tEnd - tStart;
			double elapsedSeconds = tDelta / 1000.0;
			//Dumper.print(elapsedSeconds);
		}	
		
		class NumArray {
			int n;
			int arr[];
		    public NumArray(int[] nums) {
		        int sz = nums.length;
		        n = 1;
		        while(n<sz) n*=2;
		        arr = new int[n*2-1];		
		        for(int i=0;i<sz;i++) update(i,nums[i]);
		    }
		    
		    public void update(int i, int val) {
		        i+=n-1;
		        arr[i] = val;
		        while(i>0) {
		        	i=(i-1)/2;
		        	arr[i] = arr[i*2+1]+arr[i*2+2];
		        }
		    }
		    
		    public int sumRange(int i, int j) {
		        return sum(i,j+1,0,0,n);
		    }
		    private int sum(int p, int q, int k, int i, int j) {
		    	if(p<=i&&j<=q) return arr[k];
		    	else if(j<=p||i>=q) return 0;
		    	else {
		    		return sum(p,q,k*2+1,i,i+(j-i)/2)+sum(p,q,k*2+2,i+(j-i)/2,j);
		    	}
		    }
		}		
		
	    public List<Integer> fallingSquares(int[][] positions) {
	        int n = positions.length;
	        ArrayList<Integer> arr = new ArrayList<Integer>();
	        for(int i=0;i<n;i++){
	        	arr.add(positions[i][0]);
	        	arr.add(positions[i][0]+positions[i][1]-1);
	        }
	        Collections.sort(arr);	        
	        HashMap<Integer, Integer> mp = new HashMap<Integer,Integer>();
	        for(int i=0,j=0;i<arr.size();i++){
	        	if(!mp.containsKey(arr.get(i))){
	        		mp.put(arr.get(i),j++);
	        	}
	        }
	        int square[][] = new int[n][3];
	        for(int i=0;i<n;i++){
	        	square[i][0] = mp.get(positions[i][0]);
	        	square[i][1] = mp.get(positions[i][0]+positions[i][1]-1); 
	        	square[i][2] = positions[i][1];
	        }
	        List<Integer> result = new ArrayList<Integer>();
	        seg_tree t = new seg_tree(mp.size());
	        int tmp_v = 1;
    		while(tmp_v<mp.size()) {
    			tmp_v*=2;
    		}	        
	        for(int i=0;i<n;i++){
	        	int tmp = t.query1(square[i][0], square[i][1]+1, 0, 0, tmp_v);
	        	System.out.println(tmp);
	        	t.update(square[i][0], square[i][1]+1, 0, 0, tmp_v, square[i][2]+tmp);	        	
	        	tmp = t.query(0,tmp_v, 0, 0, tmp_v);
	        	result.add(tmp);
	        }
	        return result;
	    }
	    class seg_tree{
	    	int n;
	    	int arr_leaf[];
	    	int arr_node[];
	    	public seg_tree(int x) {
	    		n=1;	    		
	    		while(n<x) {
	    			n*=2;
	    		}
	    		arr_leaf = new int[2*n-1];
	    		arr_node = new int[2*n-1];
	    	}
	    	public int update(int a, int b, int k, int i, int j, int v) {
	    		if(a<=i&&j<=b) {
	    			arr_leaf[k]=v;	   
	    			return arr_leaf[k];
	    		}else if(i<b&&a<j){
	    			int t1 = update(a,b,k*2+1,i,(i+j)/2,v);
	    			int t2 = update(a,b,k*2+2,(i+j)/2,j,v);
	    			arr_node[k] = Math.max(arr_node[k], Math.max(t1, t2));
	    			return arr_node[k];
	    		}else {
	    			return 0;
	    		}
	    	}
	    	public int query(int a, int b, int k, int i, int j) {
	    		if(b<=i||j<=a) {
	    			return 0;
	    		}else if(a<=i&&j<=b) {
	    			if(arr_leaf[k]!=0) return arr_leaf[k];
	    			else return arr_node[k];
	    		}else {
	    			int t1 = query(a,b,k*2+1,i,(i+j)/2);
	    			int t2 = query(a,b,k*2+2,(i+j)/2,j);
	    			return Math.max(t1,t2);
	    		}	    		
	    	}
	    	public int query1(int a, int b, int k, int i, int j) {
	    		if(b<=i||j<=a) {
	    			return 0;
	    		}else if(a<=i&&j<=b) {
	    			return arr_leaf[k];
	    		}else {
	    			if(arr_leaf[k]!=0) return arr_leaf[k];
	    			int t1 = query1(a,b,k*2+1,i,(i+j)/2);
	    			int t2 = query1(a,b,k*2+2,(i+j)/2,j);
	    			return Math.max(t1,t2);
	    		}	    		
	    	}	    	
	    }
	       
	    class node{
	    	long val;
	    	int idx;
	    	public node(int a, int b) {
	    		val=a;
	    		idx=b;
	    	}
	    } 

		class TreeNode {
			int val;
			TreeNode left;
			TreeNode right;

			public TreeNode(int a) {
				val = a;
			}
		}
	}

	// default class
	static class InputReader {
		public BufferedReader re;
		public StringTokenizer st;

		public InputReader(InputStream input) {
			re = new BufferedReader(new InputStreamReader(input));
			st = null;
		}

		public String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(re.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}

			}
			return st.nextToken();
		}

		public String nextLine() {
			String tmp = null;
			try {
				tmp = re.readLine();
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
			return tmp;
		}

		public boolean hasNext() {
			String tmp;
			if (st != null && st.hasMoreTokens())
				return true;
			else {
				try {
					tmp = re.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				if (tmp != null) {
					st = new StringTokenizer(tmp);
					return true;
				} else {
					return false;
				}
			}

		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}
	}

	static class Dumper {
		static void print_int_arr(int[] arr) {
			for (int i = 0; i < arr.length; i++) {
				System.out.print(arr[i] + " ");
			}
			System.out.println();
			System.out.println("---------------------");
		}

		static void print_double_arr(double[] arr) {
			for (int i = 0; i < arr.length; i++) {
				System.out.print(arr[i] + " ");
			}
			System.out.println();
			System.out.println("---------------------");
		}

		static void print_2d_arr(int[][] arr, int x, int y) {
			for (int i = 0; i < x; i++) {
				for (int j = 0; j < y; j++) {
					System.out.print(arr[i][j] + " ");
				}
				System.out.println();
			}
			System.out.println();
			System.out.println("---------------------");
		}

		static void print_2d_arr(boolean[][] arr, int x, int y) {
			for (int i = 0; i < x; i++) {
				for (int j = 0; j < y; j++) {
					System.out.print(arr[i][j] + " ");
				}
				System.out.println();
			}
			System.out.println();
			System.out.println("---------------------");
		}

		static void print(Object o) {
			System.out.println(o.toString());
		}

		static void getc() {
			System.out.println("here");
		}
	}
}
