HandsOn

$1$: Periodic String

You are given a binary string $S,$ consisting of $0\text{'}$s and $1\text{'}$s$.$

A string $B$ has period $K$ if $B[i]=B[i]+K$ for all i from $1$ to $|B|-K.$

Your task is to find a string $T$ which satisfies the following conditions:

$|T|2**|S|$

$S$ is a subsequence of $T$

Thas the smallest period possible.

Note:

$|B|$ denotes the length of string $B.$

Input Format

The first line contains a string, S$,$ denoting the given string.