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.util.*;
import java.io.*;

public class B {
	 public static void solve() {

        Kattio in = new Kattio(System.in);
       	
       	int n = in.nextInt();
       	int state = 0;

       	for(int i = 0; i < n; i++) {
       		if(state == 0 || state == 1) in.print('a');
       		else if(state == 2 || state == 3) in.print('b');

       		state++;
       		state %= 4;
       	}
        
        in.flush();
        in.close();
    }


    public static void main(String args[] ) throws Exception {


        Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
            @Override
            public void run() {
                solve();
            }
        };

        t.start();
        t.join();

    }

	public static int[] shuffle(int[] a, Random gen){ for(int i = 0, n = a.length;i < n;i++){ int ind = gen.nextInt(n-i)+i; int d = a[i]; a[i] = a[ind]; a[ind] = d; } return a; }




	private static class Kattio extends PrintWriter {
 
        private BufferedReader r;
        private String line;
        private StringTokenizer st;
        private String token;
        
        public Kattio(InputStream i) {
            super(new BufferedOutputStream(System.out));
            r = new BufferedReader(new InputStreamReader(i));
        }
        public Kattio(InputStream i, OutputStream o) {
            super(new BufferedOutputStream(o));
            r = new BufferedReader(new InputStreamReader(i));
        }
 
        public boolean hasNext() {
            return peekToken() != null;
        }
 
        public int nextInt() {
            return Integer.parseInt(nextToken());
        }
 
        public double nextDouble() { 
            return Double.parseDouble(nextToken());
        }
 
        public long nextLong() {
            return Long.parseLong(nextToken());
        }
 
        public String next() {
            return nextToken();
        }
        
        public String nextLine() {
            token = null;
            st = null;
            try {
                return r.readLine();
            } catch (IOException e) {
                return null;
            }
        }
 
        private String peekToken() {
            if (token == null) 
                try {
                    while (st == null || !st.hasMoreTokens()) {
                        line = r.readLine();
                        if (line == null) return null;
                        st = new StringTokenizer(line);
                    }
                    token = st.nextToken();
                } catch (IOException e) { }
            return token;
        }
 
        private String nextToken() {
            String ans = peekToken();
            token = null;
            return ans;
        }
    }
}