#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
int n;
pair<int, int> second[300005];
int t[300005];
int d[300005];
vector<pair<pair<int, int>, int> > mvs;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < (signed)(n); i++) {
    cin >> second[i].first;
    second[i].second = i;
  }
  for (int i = 0; i < (signed)(n); i++) {
    cin >> t[i];
  }
  sort(second, second + n);
  sort(t, t + n);
  long long sm = 0;
  for (int i = 0; i < (signed)(n); i++) {
    d[i] = t[i] - second[i].first;
    sm = sm + d[i];
    if (sm < 0) {
      cout << "NO\n";
      return 0;
    }
  }
  if (sm != 0) {
    cout << "NO\n";
    return 0;
  }
  cout << "YES\n";
  int l = 0, r = 1;
  while (l < n) {
    while (l != n && d[l] == 0) l++;
    while (r != n && d[r] >= 0) r++;
    if (l == n) break;
    int amt = min(d[l], -d[r]);
    mvs.push_back(
        make_pair(make_pair(second[l].second, second[r].second), amt));
    d[l] -= amt;
    d[r] += amt;
  }
  cout << mvs.size() << "\n";
  for (auto u : mvs) {
    cout << u.first.first + 1 << " " << u.first.second + 1 << " " << u.second
         << "\n";
  }
  return 0;
}
