Vus the Cossack has n real numbers a_i. It is known that the sum of all numbers is equal to 0. He wants to choose a sequence b the size of which is n such that the sum of all numbers is 0 and each b_i is either ⌊ a_i ⌋ or ⌈ a_i ⌉. In other words, b_i equals a_i rounded up or down. It is not necessary to round to the nearest integer.

For example, if a = [4.58413, 1.22491, -2.10517, -3.70387], then b can be equal, for example, to [4, 2, -2, -4]. 

Note that if a_i is an integer, then there is no difference between ⌊ a_i ⌋ and ⌈ a_i ⌉, b_i will always be equal to a_i.

Help Vus the Cossack find such sequence!

Input

The first line contains one integer n (1 ≤ n ≤ 10^5) — the number of numbers.

Each of the next n lines contains one real number a_i (|a_i| < 10^5). It is guaranteed that each a_i has exactly 5 digits after the decimal point. It is guaranteed that the sum of all the numbers is equal to 0.

Output

In each of the next n lines, print one integer b_i. For each i, |a_i-b_i|<1 must be met.

If there are multiple answers, print any.

Examples

Input


4
4.58413
1.22491
-2.10517
-3.70387


Output


4
2
-2
-4


Input


5
-6.32509
3.30066
-0.93878
2.00000
1.96321


Output


-6
3
-1
2
2

Note

The first example is explained in the legend.

In the second example, we can round the first and fifth numbers up, and the second and third numbers down. We can round the fourth number neither up, nor down.
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Locale;
import java.util.Map.Entry;

import java.util.Random;
import java.util.Scanner;
import java.util.TreeSet;

public final class CF_571_D2_D {


	static boolean verb=true;
	static void log(Object X){if (verb) System.err.println(X);}
	static void log(Object[] X){if (verb) {for (Object U:X) System.err.print(U+" ");System.err.println("");}}
	static void log(int[] X){if (verb) {for (int U:X) System.err.print(U+" ");System.err.println("");}}
	static void log(int[] X,int L){if (verb) {for (int i=0;i<L;i++) System.err.print(X[i]+" ");System.err.println("");}}
	static void log(long[] X){if (verb) {for (long U:X) System.err.print(U+" ");System.err.println("");}}

	static void logWln(Object X){if (verb) System.err.print(X);}
	static void info(Object o){	System.out.println(o);}
	static void output(Object o){outputWln(""+o+"\n");	}
	static void outputWln(Object o){try {out.write(""+ o);} catch (Exception e) {}}

	//static long mod=1000000007;
	static long mod=998244353 ; 
	static int CX=64;


	// Global vars
	static BufferedWriter out;
	static InputReader reader;

	static long A,B;

	//static int[] pos;
	static Composite[] pos;


	static class Composite implements Comparable<Composite>{
		int x;
		int d;
		int idx;


		public int compareTo(Composite X) {
			if (x!=X.x)
				return x-X.x;
			if (d!=X.d)
				return d-X.d;
			return idx-X.idx;
		}

		public Composite(int x, int d, int idx) {
			this.x = x;
			this.d = d;
			this.idx = idx;
		}

		public boolean equals(Object O) {
			Composite X=(Composite)O;
			return idx==X.idx; 
		}

		public int hashCode() {
			return idx;
		}



	}


	static long powerMod(long b,long e,long m){
		long x=1;
		while (e>0) {
			if (e%2==1)
				x=(b*x)%m;
			b=(b*b)%m;
			e=e/2;
		}
		return x; 
	}

	static long inv(long x,long mod) {
		return powerMod(x,mod-2,mod);
	}

	static long[][] mult(long[][] A,long[][] B,long mod){
		int M=A.length;
		long[][] res=new long[M][M];
		for (int i=0;i<M;i++)
			for (int j=0;j<M;j++) {
				res[i][j]=0;
				for (int k=0;k<M;k++) {
					res[i][j]+=A[i][k]*B[k][j];
					if (res[i][j]>=mod)
						res[i][j]%=mod;
				}
				
			}
		return res;
	}
	
	
	
	static long pgcd(long a,long b){
		if (a<b)
			return pgcd(b,a);
		while (b!=0){
			long c=b;
			b=a%b;
			a=c;
		}
		return a;
	}


	static void process() throws Exception {

		Locale.setDefault(Locale.US);
		out = new BufferedWriter(new OutputStreamWriter(System.out));
		//reader = new InputReader(System.in);

		Scanner sc=new Scanner(System.in);
		//int n=reader.readInt();
		
		int n=sc.nextInt();
		double[] a=new double[n];
	
		boolean[] block=new boolean[n];
		
		
		for (int i=0;i<n;i++) {
			a[i]=sc.nextDouble();
			if (a[i]==(int)a[i]) {
				block[i]=true;
			}
		}
		
		boolean[] visited=new boolean[n];
		long sum=0;
		int[] b=new int[n];
		
		for (int i=0;i<n;i++) {
			b[i]=(int)Math.ceil(a[i]);
			sum+=b[i];
		}
		
		for (int i=0;i<n && sum>0;i++) {
			if (!block[i]) {
				sum--;
				b[i]--;
			}
		}
		
		
		log(sum);
		
		for (int i=0;i<n;i++) {
			output(b[i]);
			
		}
		
		try {
			out.close();
		} catch (Exception E) {
		}

	}

	public static void main(String[] args) throws Exception {
		process();

	}

	static final class InputReader {
		private final InputStream stream;
		private final byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		private int read() throws IOException {
			if (curChar >= numChars) {
				curChar = 0;
				numChars = stream.read(buf);
				if (numChars <= 0) {
					return -1;
				}
			}
			return buf[curChar++];
		}

		public final String readString() throws IOException {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.append((char) c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		public final int readInt() throws IOException {
			int c = read();
			boolean neg = false;
			while (isSpaceChar(c)) {
				c = read();
			}
			char d = (char) c;
			// log("d:"+d);
			if (d == '-') {
				neg = true;
				c = read();
			}
			int res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			// log("res:"+res);
			if (neg)
				return -res;
			return res;

		}

		public final long readLong() throws IOException {
			int c = read();
			boolean neg = false;
			while (isSpaceChar(c)) {
				c = read();
			}
			char d = (char) c;
			// log("d:"+d);
			if (d == '-') {
				neg = true;
				c = read();
			}
			long res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			// log("res:"+res);
			if (neg)
				return -res;
			return res;

		}

		private boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
	}

}