A9254 | Jeff and Rounding

Jeff got $2n$ real numbers $a_{1},a_{2},...,a_{2n}$ as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes $n$ operations, each of them goes as follows:

- choose indexes $i$ and $j$ $(i≠j)$ that haven't been chosen yet;
- round element $a_{i}$ to the nearest integer that isn't more than $a_{i}$ (assign to $a_{i}$ : $⌊\ a_{i} ⌋$ );
- round element $a_{j}$ to the nearest integer that isn't less than $a_{j}$ (assign to $a_{j}$ : $⌈\ a_{j} ⌉$ ).

Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.

The first line contains integer $n$ $(1<=n<=2000)$ . The next line contains $2n$ real numbers $a_{1}$ , $a_{2}$ , $...$ , $a_{2n}$ $(0<=a_{i}<=10000)$ , given with exactly three digits after the decimal point. The numbers are separated by spaces.

In a single line print a single real number — the required difference with exactly three digits after the decimal point.