Construct Alternating Binary String

Given an integer n, construct a binary string s of length n such that for any two non-overlapping substrings a and b of equal length L, the Hamming distance (i.e. the number of positions at which the corresponding characters are different) between them is at least \( \lceil \frac{L}{2} \rceil \). In other words, if you take any two disjoint substrings of the same length from s, they must differ in at least half of their characters (rounded up).

The simplest solution is to produce an alternating binary pattern (like "010101..." or "101010...") which satisfies the above condition. Your task is to output an alternating binary string that meets the requirement.

inputFormat

The input consists of a single integer n (1 ≤ n ≤ 10⁵), representing the length of the binary string to construct.

outputFormat

Output a binary string of length n that satisfies the condition. The string must be composed only of the characters '0' and '1'.

1

0