import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

T RD(T)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }

long mod = pow(10, 9) + 7;
long moda(long x, long y) { return (x + y) % mod; }
long mods(long x, long y) { return ((x + mod) - (y % mod)) % mod; }
long modm(long x, long y) { return (x * y) % mod; }

void main()
{
	auto N = RD!ulong;
	auto X = RDR.split.to!(ulong[]);

	auto index = new ulong[](N);
	makeIndex(X, index);

	auto m1 = X[index[N/2-1]];
	auto m2 = X[index[N/2]];

	foreach (i; 0..N)
	{
		writeln(X[i] <= m1 ? m2 : m1);
	}

	stdout.flush();
}