CF873E Awards For Contestants

Alexey recently held a programming contest for students from Berland. $ n $ students participated in a contest, $ i $ -th of them solved $ a_{i} $ problems. Now he wants to award some contestants. Alexey can award the students with diplomas of three different degrees. Each student either will receive one diploma of some degree, or won't receive any diplomas at all. Let $ cnt_{x} $ be the number of students that are awarded with diplomas of degree $ x $ ( $ 1

The first line contains one integer number $ n $ ( $ 3

Output $ n $ numbers. $ i $ -th number must be equal to the degree of diploma $ i $ -th contestant will receive (or $ -1 $ if he doesn't receive any diploma). If there are multiple optimal solutions, print any of them. It is guaranteed that the answer always exists.