#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000003;
const long long INF = mod * mod;
const double eps = 1e-8;
const double pi = acos(-1.0);
struct query {
  int l, r;
  long long d;
};
void solve() {
  int n;
  cin >> n;
  vector<long long> s(n), t(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (int i = 0; i < n; i++) cin >> t[i];
  {
    long long sum = 0;
    for (int i = 0; i < n; i++) sum += s[i] - t[i];
    if (sum != 0) {
      cout << "NO" << endl;
      return;
    }
  }
  vector<pair<long long, long long> > a;
  for (int i = 0; i < n; i++) a.push_back({s[i], i});
  sort(a.begin(), a.end());
  sort(t.begin(), t.end());
  vector<query> ans;
  stack<pair<long long, long long> > st;
  for (int i = n - 1; i >= 0; i--) {
    long long dif = a[i].first - t[i];
    if (dif < 0) {
      while (!st.empty()) {
        pair<long long, long long> p = st.top();
        st.pop();
        long long dm = min(-dif, p.first);
        ans.push_back({(int)a[i].second + 1, (int)p.second + 1, dm});
        dif += dm;
        p.first -= dm;
        if (p.first > 0) st.push(p);
        if (dif == 0) break;
      }
      if (dif < 0) {
        cout << "NO" << endl;
        return;
      }
    } else if (dif > 0) {
      st.push({dif, a[i].second});
    }
  }
  cout << "YES" << endl;
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i].l << " " << ans[i].r << " " << ans[i].d << endl;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
