#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n = 7;
    vector<int> a(n);
    REP(i, 0, n) {
        cin, a[i];
    }
    sort(a.begin(), a.end());
    auto check = [&](int x, int y, int z) {
        if (x == y || x == z || y == z) return false;
        if (x > z) return false;
        return (x < y && z < y) || (x > y && z > y);
    };
    do {
        bool ok = true;
        REP(i, 0, n - 2) {
            ok &= check(a[i], a[i + 1], a[i + 2]);
        }
        if (ok) {
            cout << "YES" << endl;
            dump(a[0], a[1], a[2], a[3], a[4], a[5], a[6]);
            return 0;
        }
    } while (next_permutation(a.begin(), a.end()));
    cout << "NO" << endl;
    return 0;
}