#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> s[200000];
int a[200000];
int b[200000];
int inv[200000];
map<int, int> loc;
int c[3] = {0, 0, 0};
int za = -1, zb = -1;
int shift;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &s[i].first);
    s[i].second = i;
    c[s[i].first % 3]++;
  }
  sort(s, s + n);
  for (int i = 0; i < n; i++) {
    inv[s[i].second] = i;
  }
  if (c[0] >= c[1] && c[0] >= c[2])
    shift = 0;
  else if (c[1] >= c[0] && c[1] >= c[2])
    shift = 1;
  else
    shift = 2;
  for (int i = 0; i < n; i++) {
    s[i].first -= shift;
  }
  for (int i = 0; i < n; i++) {
    if (s[i].first < 0) {
      a[i] = 0;
      b[i] = s[i].first;
      za++;
      continue;
    }
    if (s[i].first % 3 == 0) {
      if (s[i].first % 2 == 0) {
        a[i] = s[i].first / 2;
        b[i] = s[i].first / 2;
      } else if (loc.count(s[i].first / 2) > 0) {
        int ind = loc[(s[i].first) / 2];
        a[i] = (s[i].first) / 2;
        b[i] = (s[i].first + 1) / 2;
        if (a[ind] > 0) {
          swap(a[i], b[i]);
        }
      } else if (loc.count((s[i].first + 1) / 2) > 0) {
        int ind = loc[(s[i].first + 1) / 2];
        a[i] = (s[i].first) / 2;
        b[i] = (s[i].first + 1) / 2;
        if (b[ind] > 0) {
          swap(a[i], b[i]);
        }
      } else {
        a[i] = (s[i].first) / 2;
        b[i] = (s[i].first + 1) / 2;
      }
    } else if (s[i].first % 3 == 1) {
      if (za > zb) {
        a[i] = s[i].first;
        b[i] = 0;
        zb++;
      } else {
        b[i] = s[i].first;
        a[i] = 0;
        za++;
      }
    } else {
      if (i > 0 && s[i].first == s[i].first - 1) {
        a[i] = b[i - 1];
        b[i] = a[i - 1];
        if (a[i] != 0) {
          a[i]++;
          zb++;
        }
        if (b[i] != 0) {
          b[i]++;
          za++;
        }
      } else if (za > zb) {
        a[i] = s[i].first;
        b[i] = 0;
        zb++;
      } else {
        b[i] = s[i].first;
        a[i] = 0;
        za++;
      }
    }
    loc[s[i].first] = i;
  }
  for (int i = 0; i < n; i++) {
    b[i] += shift;
  }
  printf("YES\n");
  for (int i = 0; i < n; i++) {
    printf("%d ", a[inv[i]]);
  }
  printf("\n");
  for (int i = 0; i < n; i++) {
    printf("%d ", b[inv[i]]);
  }
}
