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.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
 
public class Sol
{
    
    static long mod=1000000007;
    
    public static void main(String args[]) throws Exception
    {
        InputReader in;
        PrintWriter w;
        boolean online = false;
        String fileName = "input";

        if (online) 
        {
            in = new InputReader(new FileInputStream(new File(fileName + ".in")));
            w = new PrintWriter(new FileWriter("out.txt"));
        } 
        else 
        {
            in = new InputReader(System.in);
            w = new PrintWriter(System.out);
        }
        
        //nt T = in.nextInt();
        int T=1;
        
        for (int t = 1; t <= T; t++) 
        {
            int n=in.nextInt();
            
            //String s="";
            //s+="a";
            w.print("a");
            
            int ct=0;
            String s1="aa";
            String s2="bb";
            
            if(n>1)
            {
                if(n%2==0)
                {
                    while(n-1>1)
                    {
                        if(ct==0)
                        {
                            //s+=s2;
                            w.print("bb");
                            ct=1;
                        }
                        
                        else if(ct==1)
                        {
                            //s+=s1;
                            w.print("aa");
                            ct=0;
                        }
                        
                        n-=2;
                    }
                    
                    if(ct==0)
                        w.print("b");   ///s+="b";
                    
                    else
                        w.print("a");                //s+="a";
                }
                
                else
                {
                    while(n-1>0)
                    {
                        if(ct==0)
                        {
                            w.print("bb");  //s+=s2;
                            ct=1;
                        }
                        
                        else if(ct==1)
                        {
                            w.print("aa");   //s+=s1;
                            ct=0;
                        }
                        
                        n-=2;
                    }
                }
            }
            
            w.println();
        }

        w.close();
    }
    
    private static long gcd(long a, long b)
    {
        while (b > 0)
        {
            long temp = b;
            b = a % b; // % is remainder
            a = temp;
        }
        return a;
    }
 
    private static long gcd(long[] input)
    {
        long result = input[0];
        
        for(int i = 1; i < input.length; i++) 
            result = gcd(result, input[i]);
        
        return result;
    }
    
    private static long lcm(long a, long b)
    {
        return a * (b / gcd(a, b));
    }
 
    private static long lcm(long[] input)
    {
        long result = input[0];
        
        for(int i = 1; i < input.length; i++) 
            result = lcm(result, input[i]);
        
        return result;
    }
    
    public static void Array_2dsort(Integer[][] a)
    {
        Arrays.sort(a, new Comparator<Integer[]>() 
        {
            public int compare(Integer[] int1, Integer[] int2) 
            {
                Integer numOfKeys1 = int1[1];       //about which column u want to sort
                Integer numOfKeys2 = int2[1];
                return numOfKeys1.compareTo(numOfKeys2);
            }
        });
    }
     
    static long powmod(long x,long n,long m)        //(a/b)%mod = (a * (b^(m-2))%mod  here --> x=a, n=mod-2, m=mod  
    {
	if (n == 0)
            return 1;
        else if (n%2==0)
            return powmod(((x%m)*(x%m))%m,n/2,m);
	else if(n%2==1)
            return (((x%m)*powmod(((x%m)*(x%m))%m,(n-1)/2,m))%m);
	else
            return 0;
    }
        
	
	static class InputReader
	{
	
                private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		private SpaceCharFilter filter;
		
		public InputReader(InputStream stream)
		{
			this.stream = stream;
		}
		
		public int read()
		{
			if (numChars==-1) 
				throw new InputMismatchException();
			
			if (curChar >= numChars)
			{
				curChar = 0;
				try 
				{
					numChars = stream.read(buf);
				}
				catch (IOException e)
				{
					throw new InputMismatchException();
				}
				
				if(numChars <= 0)				
					return -1;
			}
			return buf[curChar++];
		}
	 
		public String nextLine()
		{
			BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
			String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
		}
		public int nextInt()
		{
			int c = read();
			
			while(isSpaceChar(c)) 
				c = read();
			
			int sgn = 1;
			
			if (c == '-') 
			{
				sgn = -1;
				c = read();
			}
			
			int res = 0;
			do 
			{
				if(c<'0'||c>'9') 
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			}
			while (!isSpaceChar(c)); 
			
			return res * sgn;
		}
		
		public long nextLong() 
		{
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') 
			{
				sgn = -1;
				c = read();
			}
			long res = 0;
			
			do 
			{
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			}
			while (!isSpaceChar(c));
				return res * sgn;
		}
		
		public double nextDouble() 
		{
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') 
			{
				sgn = -1;
				c = read();
			}
			double res = 0;
			while (!isSpaceChar(c) && c != '.') 
			{
				if (c == 'e' || c == 'E')
					return res * Math.pow(10, nextInt());
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			}
			if (c == '.') 
			{
				c = read();
				double m = 1;
				while (!isSpaceChar(c)) 
				{
					if (c == 'e' || c == 'E')
						return res * Math.pow(10, nextInt());
					if (c < '0' || c > '9')
						throw new InputMismatchException();
					m /= 10;
					res += (c - '0') * m;
					c = read();
				}
			}
			return res * sgn;
		}
		
		public String readString() 
		{
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do 
			{
				res.appendCodePoint(c);
				c = read();
			} 
			while (!isSpaceChar(c));
			
			return res.toString();
		}
	 
		public boolean isSpaceChar(int c) 
		{
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
	 
		public String next() 
		{
			return readString();
		}
		
		public interface SpaceCharFilter 
		{
			public boolean isSpaceChar(int ch);
		}
	}
    
}