#include <bits/stdc++.h>

using namespace std;
const int c=55;
long long n, x[c], y[c], d[c];
bool jo(int kezd) {
    long long sum=0, maxval=0, ert=abs(x[n]-x[kezd])+abs(y[n]-y[kezd]);
    sum=maxval=ert;
    for (int i=kezd; i<n; i++) {
        sum+=d[i];
        maxval=max(maxval, d[i]);
    }

    return (sum%2==0 && 2*maxval<=sum);
}
int main()
{
    cin >> n >> x[n] >> y[n];
    long long sum=0, maxval=0;
    d[n]=abs(x[n]+y[n]);
    for (int i=1; i<n; i++) {
        cin >> d[i];
    }
    for (int i=1; i<=n; i++) {
        sum+=d[i];
        maxval=max(maxval, d[i]);
    }

    if (sum%2 || 2*maxval>sum) {
        cout << "NO\n";
        return 0;
    }

    for (int i=1; i<n-1; i++) {
        x[i+1]=x[i], y[i+1]=y[i];

        x[i+1]=x[i]+d[i];
        if (jo(i+1)) continue;
        x[i+1]=x[i]-d[i];
        if (jo(i+1)) continue;

        x[i+1]=x[i];
        y[i+1]=y[i]+d[i];
        if (jo(i+1)) continue;
        y[i+1]=y[i]-d[i];
        if (jo(i+1)) continue;

        /*cout << "baj " << i << "\n";
        cout << "x " << x[n] << " " << x[i] << "\n";
        cout << "y " << y[n] << " " << y[i] << "\n";*/
        //assert(false);


        int pos=i;

        long long sx=abs(x[n]-x[pos]), sy=abs(y[n]-y[pos]), ossz=sx+sy;
        long long lep=0;
        for (int i=pos; i<n; i++) {
            lep+=d[i];
        }
        long long spec=(lep-ossz)/2;


        //cout << "fontos " << spec << " " << d[pos] << "\n";
        assert(spec>=0);
        assert(spec<=d[pos]);


        bool csere=0;
        if (sx>sy) {
            csere=1;
            swap(sx, sy);

            swap(x[pos], y[pos]), swap(x[n], y[n]);
        }


        if (spec>0) {

            x[pos+1]=x[pos], y[pos+1]=y[pos];

            if (x[pos]<=x[n]) {
                x[pos+1]-=spec;
            } else {
                x[pos+1]+=spec;
            }

            long long rem=d[pos]-spec;
            if (y[pos]<=y[n]) {
                y[pos+1]+=rem;
            } else {
                y[pos+1]-=rem;
            }
        } else {
            x[pos+1]=x[n], y[pos+1]=y[pos];
            long long rem=d[pos]-sx;
            if (y[pos]<=y[n]) {
                y[pos+1]+=rem;
            } else {
                y[pos+1]-=rem;
            }

        }

        if (csere) {
            for (int i=pos; i<=n; i++) swap(x[i], y[i]);
        }

    }






    cout << "YES\n";

    for (int i=1; i<=n; i++) {
        cout << x[i] << " " << y[i] << "\n";
    }
    return 0;
}
/*
8
100 100
1 2 3 100 100 100 4
*/