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.
//Author: Mo Abjal, MJP Rohilkhand University Bareilly, UP, India 2018.
/////////////////////////////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////********************////////////////////////////////////////
/////////////////////////////////////////*     SOLUTION     *////////////////////////////////////////
/////////////////////////////////////////********************////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////////////////////////////
//  
import java.util.*;
import java.io.*;
import java.text.*;
import java.math.*;
public class Main{
	public static StringTokenizer token = new StringTokenizer("");
	public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	public static PrintWriter output = new PrintWriter(System.out);
	public static void main(String[] afzal) throws Exception {	
		int N = ni();
		int count=0;
		for(int i=0;true;i++){
			if(i%2==0){
				if(count==N-1){
					output.print("a"); break;
				}
				else{
					output.print("aa");
				}
			}
			else{
				if(count==N-1){
					output.print("b"); break;
				}
				else{
					output.print("bb");
				}
			}
			count+=2;
			if(count==N) break;
		}
		output.close();
		/*int N = ni();
		int K = ni();
		String S[] = new String[N];
		for(int i=0;i<N;i++){
			S[i] = ns();
		}
		String password = ns();
		int min = 1;
		for(int i=0;i<N;i++){
			for(int j=0;j<N-1;j++){
				if(S[j].length()>S[j+1].length()){
					String temp = S[j];
					S[j] = S[j+1];
					S[j+1] = temp;
				}
			}
		}
		//for(int i=0;i<N;i++) output.println(S[i]);
		for(int i=0;i<N;i++){
			if(password.length()<=S[i].length()){
				break;
			}
			min++;
		}
		int max = 1;
		for(int i=0;i<N;i++){
			if(password.length()<S[i].length()){
				max++;
			}
			else{
				break;
			}
		}
		max = (N-max+1);
		//output.println(max);
		output.println(min+" "+max);/*
		if(max>K)
		max = (max/K)*5+max;
		output.print(min+" "+(max+1)); output.close();
		/*int N = ni();
		boolean flag = true;
		int x = N;
		while(x>0){
			if(x%10==0 || x%10==1){				
			}
			else{
				flag = false; break;
			}
			x/=10;
		}
		if(flag){
			output.println("1\n"+N); output.close(); return;
		}
		String temp = "";
		int count = 1;
		for(int i=0;count<=ps(N).length();i++){
			temp+="1"; count++;
		}
		if(temp=="") temp="1";
		int test = pi(temp);

		int ans=0;
		int A[] = new int[N+5];
		int j=0;
		//output.println(test);
		while(N>0){
			if(N>=test){
				A[j] = test; N-=test; ans++;
				j++;
				//System.out.println(A[j]+" ");
			}
			else if(test%10==0 && (test/10)%10==1){
				test-=9;
			}
			else if(test%10==1 && (test/10)%10==0){
				test-=90;
			}
			else if(test%10==1 && (test/10)%10==1){
				test--;
			}
			
		}
		output.println(ans);
		for(int i=0;A[i+1]!=0;i++){
			output.print(A[i]+" ");
		}
		output.println(test); output.close();*/
	}
	public static String pc(char c){
		return Character.toString(c);
	} 
	public static Integer pci(char c){
		return pi(Character.toString(c));
	}
	public static Integer pi(String str){
		return Integer.parseInt(str);
	}
	public static Long pl(String str){
		return Long.parseLong(str);
	}
	public static String ps(Integer N){
		return Integer.toString(N);
	}
	public static char[] pcc(String str){
		return str.toCharArray();
	}
	public static Integer ni() throws IOException{
		if(!token.hasMoreElements()){
			token = new StringTokenizer(br.readLine());
		}
		return Integer.parseInt(token.nextToken());
	}
	public static Long nl() throws IOException{
		if(!token.hasMoreElements()){
			token = new StringTokenizer(br.readLine());
		}
		return Long.parseLong(token.nextToken());
	}
	public static Double nd() throws IOException{
		if(!token.hasMoreElements()){
			token = new StringTokenizer(br.readLine());
		}
		return Double.parseDouble(token.nextToken());
	}
	public static String ns() throws IOException{
		return new StringTokenizer(br.readLine()).nextToken();
	}
	public static Integer[] ai(int N) throws IOException{
		Integer A[] = new Integer[N];
		token = new StringTokenizer(br.readLine());
		for(int i=0;i<A.length;i++){
			A[i] = pi(token.nextToken());
		}
		return A;
	}
	public static long[] al(int N) throws IOException{
		long A[] = new long[N];
		token = new StringTokenizer(br.readLine());
		for(int i=0;i<N;i++){
			A[i] = Long.parseLong(token.nextToken());
		}
		return A;
	}
	public static char[][] acc(int N,int M) throws IOException{
		char C[][] = new char[N][M];
		for(int i=0;i<N;i++){
			token = new StringTokenizer(br.readLine());
			String s = token.nextToken();
			for(int j=0;j<M;j++){
				C[i][j] = s.charAt(j);
			}
		}
		return C;
	}
	public static String[] as(int N) throws IOException{
		String S[] = new String[N];
		token = new StringTokenizer(br.readLine());
		for(int i=0;i<S.length;i++){
			S[i] = token.nextToken();
		}
		return S;
	}

	public static long fact(long N){
		long fact = 1;
		for(int i=1;i<=N;i++){
			fact = fact * i;
		}
		return fact;
	}
	public static BigInteger factB(int N){
		BigInteger b = new BigInteger("1");
		for(int i=1;i<=N;i++){
			b = b.multiply(BigInteger.valueOf(i));
		}
		return b;
	}
	public static long sod(long N){
		long sum = 0;
		while(N>0){
			long x = N%10;
			sum = sum + x;
			N = N/10;
		}
		return sum;
	}
	public static Integer cd(long N){
		int count=0;
		while(N>0){
			N = N/10; count++;
		}
		return count=0;
	}
}
class Pair implements Comparable{
	int a,b;
	public Pair(int a,int b){
		this.a = a;
		this.b = b;
	}
	public int compareTo(Object p){
		Pair pa = (Pair)p;
		if(this.a==pa.a) return this.b - pa.b;
		return this.a - pa.a;
	} 
}
//Copyright Reserved - Mo Abjal.