#include <cstdio>
#include <algorithm>

int n, S[30300], dt[3][30300], ans[4], done;

void solve(int x, int c, int sum)
{
    if( x == n+1 || done ) return;
    if( c == 3 )
    {
       // printf("%d %d %d = %d\n", ans[0], ans[1], ans[2], sum);
        if( sum == 0 )
        {
            printf("%d %d %d\n", ans[0], ans[1], ans[2]);
            done = true;
        }
        return;
    }
    int t = ans[c];
    ans[c] = S[x];
    solve(x+1, c+1, sum+S[x]);
    ans[c] = t;
    solve(x+1, c, sum);
}

int main()
{
    freopen(".10.in","r",stdin);
    freopen(".10.out","w",stdout);
    scanf("%d", &n);
    for(int i = 0 ; i < n ; i++ )
        scanf("%d", S+i);
    std::sort(S, S+n);
    solve(0, 0, 0);
    if( !done ) puts("NO");
}