import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int N; int[] A; void main() { try { for (; ; ) { N = readInt(); A = new int[N]; foreach (i; 0 .. N) { A[i] = readInt(); } auto es = new Tuple!(int, int)[N]; foreach (i; 0 .. N) { es[i] = tuple(A[i], i); } es.sort; auto as = new int[][N + 1]; for (int i = 0, j = 0; i < N; i = j) { for (; j < N && es[i][0] == es[j][0]; ++j) {} as[es[i][1]] ~= es[i][0]; as[es[j - 1][1] + 1] ~= es[i][0]; } debug { writeln("as = ", as); } auto rbt = new RedBlackTree!int(); auto ans = new int[N]; foreach (i; 0 .. N) { foreach (a; as[i]) { if (rbt.insert(a) == 0) { rbt.removeKey(a); } } debug { writeln("rbt = ", rbt); } ans[i] = rbt.back; } writeln(ans.to!string.replaceAll(regex(`[\[\],]`), "")); } } catch (EOFException e) { } }