3-palindrome java

最新推荐文章于 2021-11-23 16:10:30 发布

原创最新推荐文章于 2021-11-23 16:10:30 发布 · 399 阅读

0 ·

CC 4.0 BY-SA版权

cf 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种算法，用于生成指定长度的字符串，该字符串由字符'a'、'b'和尽可能少的'c'组成，并确保不包含任何长度为3的回文子串。通过一种特定的模式来实现这一目标。

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·10⁵) — 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

Output

aa

Input

Output

bba

Note

A palindrome is a sequence of characters which reads the same backward and forward.

import java.util.Scanner;
public class Main {
	@SuppressWarnings("resource")
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			int n=sc.nextInt();int sum=0;
			for (int i = 0; i < n; i++) {
				if (sum<2) {
					System.out.print("a");
					sum++;
				}else {
					System.out.print("b");
					sum++;
				if (sum==4) {
					sum=0;
				}
				}
			}System.out.println();
		}

	}

}