No 114514

题号：NC216212
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
Special Judge, 64bit IO Format: %lld

题目描述

$Awei{}$ found too much " $114514{}$ " in this problem set. As a $24{}$ years old student, he can't stand it anymore. So he invites you to help him clean up the problem set.

$Awei{}$ has a sequence $A{}$ consists of $N{}$ numbers, the indices label from $1{}$ to $N{}$ . Each number $A_i$ in the sequence can only be $1{}$ or $4{}$ or $5{}$ . He does not want six consecutive numbers $[1,1,4,5,1,4]{}$ in the sequence $A{}$ , so he invites you to perform some operations on the sequence. In one operation, you can select an integer $i{}$ and change $A_i$ to $B_i$ , $B_i$ can only be $1{}$ or $4{}$ or $5{}$ . Your task is to make the sequence $A{}$ do not contains the six consecutive numbers $[1,1,4,5,1,4]{}$ in at most $\lfloor \frac {N}{6}\rfloor$ (rounding down) operations.
You are not required to minimize the number of operations.

输入描述:

The first line of the input contains an integer , denoting the length of the sequence.
The second line of the input contains  Integers , it's guaranteed that .

输出描述:

You should print  numbers in one line, denoting the sequence  after your operations.
We have proof that a solution always exists. If there are multiple solutions, print any.
End-of-line spaces are allowed in this problem. You can output with or without end-of-line spaces.

示例1

输入

复制

7
1 1 1 4 5 1 4

输出

复制

1 4 1 4 5 1 4