// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

template<typename T>
struct BIT_{
  int n;
  vector<T> bit;
  BIT_(int n_){
    n = n_;
    bit = vector<T>(n+1, 0);
  }
  void add(int a, T w){
    for(int x = a; x < n; x |= (x + 1)){
      bit[x] += w;
    }
  }
  T sum(int a){
    T res = 0;
    for(int x = a; x >= 0; x = (x & (x + 1)) - 1){
      res += bit[x];
    }
    return res;
  }
};

typedef struct BIT_<int> BITI;
typedef struct BIT_<long long> BITL;

struct house{
  ll x, l, r;
  house(){ }
  house(ll x, ll l, ll r): x(x), l(l), r(r){}
  bool operator<(const house &right) const{
    return x < right.x;
  }
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<ll> a(n), l(n), r(n);
  rep(i, n)cin >> a[i];
  rep(i, n)cin >> l[i] >> r[i];
  vector<house> h(n);
  rep(i, n)h[i] = house(a[i], l[i], r[i]);
  vector<Pl> vec(2 * n);
  rep(i, n){
    vec[2 * i] = mk(a[i], - i - 1);
    vec[2 * i + 1] = mk(a[i] + r[i], i + 1);
  }
  sort(all(vec));
  ll res = 0;
  BITI bt(n);
  for(int i = 0; i < 2 * n; i++){
    if(vec[i].second < 0){
      int index = - vec[i].second - 1;
      int k = lower_bound(all(h), house(h[index].x - h[index].l, -1, -1)) - h.begin();
      if(index > 0)res += bt.sum(index - 1) - (k > 0 ? bt.sum(k-1): 0);
      bt.add(index, 1);
    }else{
      int index = vec[i].second - 1;
      bt.add(index, - 1);
    }
  }
  cout << res << endl;
	return 0;
}