#include<iostream>
#include<vector>
#include<map>
#include<algorithm>

using namespace std;

int main() {
    vector<int> v;
    map<int, int> elements;
    map<int, int> counts;
    for (size_t i = 0; i < 3; ++i) {
        int x;
        cin >> x;
        v.push_back(x);
        counts[v[i]] = 0;
    }
    for (size_t i = 0; i < v.size(); ++i) {
        for (size_t j = 0; j < v.size(); ++j) {
            vector<int> c = v;
            elements[c[0]] = c[0];
            elements[c[1]] = c[1];
            elements[c[2]] = c[2];
            if (i != j) {
                elements[c[i]] = c[i] - c[j];
                c[i] = c[i] - c[j];
                sort(begin(c), end(c));
                for (const auto& item : elements) {
                    if (c[1] == item.first || item.second == c[1])
                        ++counts[item.first];
                }
            }
        }
    }
    for (const auto& x : counts)
        if (x.second > 0)
            cout << x.first << " : " << "YES" << endl;
        else
            cout << x.first << " : " << "NO" << endl;

}