//#pragma GCC optimize("unrool-loop")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define loop(i,s,e) for(int i=s; i<e; i++)
#define x first
#define y second
#define all(a) a.begin(),a.end()
#define pb push_back
const ll INF = 1e18;

ll sign(ll x) {
    return (x >= 0 ? 1 : -1);
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    auto t = chrono::high_resolution_clock::now();
    int n; cin>>n; n--;
    int a,b; cin>>a>>b;
    bool trans = 0;
//    if (b < a) swap(a, b), trans = 1;
    vi d(n); loop(i,0,n) cin>>d[i];
    ll sum = 0;
    loop(i,0,n) sum+=d[i];
    if (sum < a+b) return cout<<"NO"<<endl,0;
    ll diff = sum - (a+b);
    if (diff % 2 != 0) return cout<<"NO"<<endl,0;
    ll X = diff / 2;
    vector<ii> d2(n);
    loop(i,0,n) d2[i] = {d[i], i};
    sort(all(d2)), reverse(all(d2));
    vector<pair<ll, ll>> ps(n);
    pair<ll, ll> cur = {a,b};
    for(auto pp:d2) {
        int i = pp.y, dd = pp.x;
        ll A = abs(cur.x) + abs(cur.y);
        if (sum - dd >= A + dd) {
            ps[i] = {sign(cur.x) * dd, 0};
        } else if (abs(cur.y) >= dd || (sum - dd >= cur.x + (dd - abs(cur.y)))) {
            // go up in x, and down in y
            ll l = 0, r = dd + 1, mid, ans = 0;
            while (l < r) {
                mid = (l+r)/2;
                ll AA = A + mid - (dd-mid);
                if (sum - dd >= AA) ans = mid, l = mid+1;
                else r = mid;
            }
            ps[i] = {sign(cur.x) * ans, -sign(cur.y) * (dd - ans)};
        } else {
            // go down in y and down in x, at least abs(cur.y) in y
            ll ddd = dd - abs(cur.y);
            ll l = 0, r = ddd + 1, mid, ans = 0;
            while (l < r) {
                mid = (l+r)/2;
                ll AA = A - abs(cur.y) + mid - (ddd - mid);
                if (sum - dd >= AA) ans = mid, l = mid+1;
                else r = mid;
            }
            ps[i] = {-sign(cur.x) * (ddd - ans), -sign(cur.y) * (ans + abs(cur.y))};
        }
        cur.x += ps[i].x;
        cur.y += ps[i].y;
        sum -= dd;
    }
    if (cur.x != 0 && cur.y != 0) {
        cout << "NO" <<endl;
        return 0;
    }
    vector<pair<ll, ll>> ans(n+1); ans[0] = {0,0};;
    loop(i,0,n) {
        ans[i+1].x = ans[i].x - ps[i].x;
        ans[i+1].y = ans[i].y - ps[i].y;
    }
    if (trans) {
        loop(i,0,n+1) swap(ans[i].x, ans[i].y);
    }
    cout << "YES" << endl;
    loop(i,0,n+1) {
        cout << ans[i].x<<" "<<ans[i].y<<endl;
    }
    auto s = chrono::high_resolution_clock::now();
    auto rv = chrono::duration_cast<chrono::milliseconds>(s-t).count();
    cerr << "Took: "<<rv<<" ms"<<endl;
    return 0;
}