#include <cstdio>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <memory.h>

#define MAXN ( 1<<10 )

unsigned int A[MAXN];
unsigned int B[MAXN];


/*
int getMedian(unsigned int Ai[], int len)
{
	const int ArrayLength = sizeof(Ai) / sizeof(int);
	std::sort(Ai, A+MAXN);

	...
}
*/

int main()
{
	freopen("median.in", "r", stdin);
	freopen("median.out", "w", stdout);
	memset(&B, 0, sizeof(A));

	int N;

	scanf("%d", &N);

	for(int i=0; i<N; ++i)
	{
		scanf("%d", &A[i]);
	}

	const int MaxElement = *std::max_element(A, A+MAXN);

	for(int i=0; i<N; ++i)
	{
		if(A[i] == MaxElement) A[i] = MaxElement;
		else
		{
			B[i] = N - A[i] + 1;
		}
	}



	for(int i=0; i<N; ++i) printf("%d ", B[i]);
	printf("\n");

	return 0;
}
<!-- 0.0431s -->