#include <iostream>

#include <sstream>

#include <algorithm>

#include <cstdio>

#include <math.h>

#include <set>

#include <map>

#include <queue>

#include <string>

#include <string.h>

#include <bitset>

#define REP(i,a,n) for(int i=a;i<=n;++i)

#define PER(i,a,n) for(int i=n;i>=a;--i)

#define hr putchar(10)

#define pb push_back

#define lc (o<<1)

#define rc (lc|1)

#define mid ((l+r)>>1)

#define ls lc,l,mid

#define rs rc,mid+1,r

#define x first

#define y second

#define io std::ios::sync_with_stdio(false)

#define endl '\n'

#define DB(a) ({REP(__i,1,n) cout<<a[__i]<<' ';hr;})

using namespace std;

typedef long long ll;

typedef pair<int,int> pii;

const int P = 1e9+7, P2 = 998244353, INF = 0x3f3f3f3f;

ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}

ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}

ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}

inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}

//head

const int N = 1e6+10;

int n, c1, d1;

struct _ {

	int x,id;

	bool operator < (const _ &rhs) const {

		return x<rhs.x;

	}

} a[N], b[N], c[N], d[N];

int p1[N],p2[N],p3[N],cnt,f[N];

void add(int x, int y, int v) {

	++cnt;

	if (f[x]>f[y]) puts("NO"),exit(0);

	p1[cnt]=x,p2[cnt]=y,p3[cnt]=v;

	f[x]+=v,f[y]-=v;

}

int main() {

	scanf("%d", &n);

	ll s1=0,s2=0;

	REP(i,1,n) {

		scanf("%d",&a[i].x),a[i].id=i,s1+=a[i].x;

		f[i]=a[i].x;

	}

	REP(i,1,n) scanf("%d",&b[i].x),b[i].id=i,s2+=b[i].x;

	if (s1!=s2) return puts("NO"),0;

	sort(a+1,a+1+n);

	sort(b+1,b+1+n);

	REP(i,1,n) {

		if (a[i].x<b[i].x) c[++c1]={b[i].x-a[i].x,a[i].id};

		else if (a[i].x>b[i].x) d[++d1]={a[i].x-b[i].x,a[i].id};

	}

	sort(d+1,d+1+d1,[](_ x,_ y){return f[x.id]>f[y.id];});

	sort(c+1,c+1+c1,[](_ x,_ y){return f[x.id]>f[y.id];});

	int now = 1;

	REP(i,1,d1) {

		while (now<=c1&&c[now].x<=d[i].x) {

			add(c[now].id,d[i].id,c[now].x);

			d[i].x-=c[now].x, ++now;

		}

		if (d[i].x) {

			add(c[now].id,d[i].id,d[i].x);

			c[now].x-=d[i].x;

		}

	}

	puts("YES");

	printf("%d\n",cnt);

	REP(i,1,cnt) printf("%d %d %d\n",p1[i],p2[i],p3[i]);

}