package 蓝桥杯第十一次;

import java.util.Arrays;
import java.util.Scanner;

public class 最少刷题数 {
/*	5
	12 10 15 20 6
	0 3 0 0 7
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n+1];
		int b[] = new int[n+1];
		for(int i=1;i<=n;i++) {
			a[i] = sc.nextInt();
			b[i] = a[i];
		}
		Arrays.sort(a);
		int avg = a[n/2+1];//中位数
		int less = 0;
		int more = 0;
		//找出刷题数比中位数少和多的人
		for(int i=1;i<=n;i++) {
			if(a[i]<avg) {
				less++;
			}
			if(a[i]>avg) {
				more++;
			}
		}
		for(int i=1;i<=n;i++) {
			if(b[i]>avg) {
				b[i]=0;
			}else if(b[i]==avg) {
				//如果刷题少的人比刷题多的人要少，则还要多刷一题
				if(less<more) {
					b[i]=1;
				}else {
					b[i]=0;
				}
			}else {
				if(more<less) {
					b[i]=avg-b[i];
				}else {
					b[i]=avg-b[i]+1;
				}
			}
		}
		for(int i=1;i<=n;i++) {
			System.out.print(b[i]+" ");
		}
	}

}