B. Circus
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Polycarp is a head of a circus troupe. There are nn — an even number — artists in the troupe. It is known whether the ii-th artist can perform as a clown (if yes, then ci=1ci=1, otherwise ci=0ci=0), and whether they can perform as an acrobat (if yes, then ai=1ai=1, otherwise ai=0ai=0).
Split the artists into two performances in such a way that:
- each artist plays in exactly one performance,
- the number of artists in the two performances is equal (i.e. equal to n2n2),
- the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer nn (2≤n≤50002≤n≤5000, nn is eve