#include <bits/stdc++.h>
#pragma GCC optimize("O3")

#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair

#define pi pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>

#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for(ll i = a; i <= (b); ++i)
#define rep3(i, a, b) for(ll i = a; i >= (b); --i)
#define all(v) (v).begin(), (v).end()
#define si(v) (int)(v).size()

using namespace std;

template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

constexpr ll MOD = 1000000007, MAX = 100005;

signed main()
{
  cout << fixed << setprecision(10);
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n; cin >> n;
  vi x(n);
  rep(i, n) cin >> x[i];

  int sum = accumulate(all(x),0);
  int ave = sum / n;

  rep(i, n) cout << 50 - (ave - x[i]) / 2 << '\n';

  return (0);
}