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 Q2 {

	public static void main(String args[]){
		InputReader br = new InputReader(System.in);
		//OutputWriter out	=	new OutputWriter(System.out);
		//Scanner sc=new Scanner(System.in);
		
		int n=br.readInt();
		int in=1;
		StringBuilder sb=new StringBuilder("");
		for(int i=0;i<n/2;i++){
			if(i%2==0)	{sb.append("aa");in=1;}
			else	{sb.append("bb");in=2;}
		}
		
		if(n%2==1){
			if(in==1)
				sb.append('b');
			else
				sb.append('a');
		}
		System.out.println(sb.toString());
		
	}
}


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 int readInt() {
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 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);
}
}

class OutputWriter {
private final PrintWriter writer;

public OutputWriter(OutputStream outputStream) {
writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
}

public OutputWriter(Writer writer) {
this.writer = new PrintWriter(writer);
}

public void print(Object...objects) {
for (int i = 0; i < objects.length; i++) {
	if (i != 0)
		writer.print(' ');
	writer.print(objects[i]);
}
}

public void printLine(Object...objects) {
print(objects);
writer.println();
}

public void close() {
writer.close();
}

public void flush() {
writer.flush();
}

}

class IOUtils {

public static int[] readIntArray(InputReader in, int size) {
int[] array = new int[size];
for (int i = 0; i < size; i++)
	array[i] = in.readInt();
return array;
}

}                                                
