{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ of even length consisting of lowercase English letters. Let $|S|$ be the length of $S$, and $S_i$ be the $i$\\-th character of $S$.\nPerform the following operation for each $i = 1, 2, \\ldots, \\frac{|S|}{2}$ in this order, and print the final $S$.\n\n*   Swap $S_{2i-1}$ and $S_{2i}$."},{"iden":"constraints","content":"*   $S$ is a string of even length consisting of lowercase English letters.\n*   The length of $S$ is at most $100$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"abcdef"},{"iden":"sample output 1","content":"badcfe\n\nInitially, $S =$ `abcdef`.  \nPerforming the operation for $i = 1$ swaps $S_1$ and $S_2$, making $S =$ `bacdef`.  \nPerforming the operation for $i = 2$ swaps $S_3$ and $S_4$, making $S =$ `badcef`.  \nPerforming the operation for $i = 3$ swaps $S_5$ and $S_6$, making $S =$ `badcfe`.  \nThus, `badcfe` should be printed."},{"iden":"sample input 2","content":"aaaa"},{"iden":"sample output 2","content":"aaaa"},{"iden":"sample input 3","content":"atcoderbeginnercontest"},{"iden":"sample output 3","content":"taocedbrgeniencrnoetts"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}