#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
  gn(x1, x2), gn(x3);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = (long long)a * a % m)
    if (b & 1) ans = (long long)ans * a % m;
  return ans;
}
long long p[11][11][3];
int first[11], dp[11];
long long d[30];
void calc(int n) {
  if (n == 7) {
    int N = 0;
    for (int i = 0; i < 8; i++) {
      for (int j = i + 1; j < 8; j++) {
        d[N] = 0;
        for (int k = 0; k < 3; k++) {
          d[N] += ((p[dp[i]][i][k] - p[dp[j]][j][k]) *
                   (p[dp[i]][i][k] - p[dp[j]][j][k]));
        }
        N++;
      }
    }
    sort(d, d + N);
    if (!d[0] || d[12] != 2 * d[0] || d[24] != 3 * d[0]) return;
    for (int i = 1; i < 12; i++)
      if (d[i - 1] != d[i]) return;
    for (int i = 13; i < 24; i++)
      if (d[i - 1] != d[i]) return;
    for (int i = 25; i < 28; i++)
      if (d[i - 1] != d[i]) return;
    puts("YES");
    for (int i = 0; i < 8; i++) {
      for (int j = 0; j < 3; j++) {
        printsp(p[dp[i]][i][j]);
      }
      puts("");
    }
    exit(0);
  }
  for (dp[n] = 0; dp[n] < 6; dp[n]++) calc(n + 1);
}
int main() {
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 3; j++) {
      gn(p[0][i][j]);
    }
  }
  for (int i = 0; i < 3; i++) first[i] = i;
  int n = 0;
  do {
    for (int j = 0; j < 7; j++) {
      for (int k = 0; k < 3; k++) {
        p[n][j][k] = p[0][j][first[k]];
      }
    }
    n++;
  } while (next_permutation(first, first + 3));
  calc(0);
  puts("NO");
}
