#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <chrono>
#include <random>
#include <unordered_map>
#include <cassert>
#pragma GCC optimize("O3")
#pragma comment(linker, "STACK:36777216")
using namespace std;
using i64 = int64_t;
constexpr i64 MOD = 1e9 + 7;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
using vi = vector<i64>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ii = pair<i64, i64>;

class RangeCount {
    const int ST_SIZE = (1 << 20) - 1;
    int n;
    vi data;
    vvi segtree;
    
    void init(int k, int l, int r) {
        if (r - l == 1) {
            segtree[k].push_back(data[l]);
        } else {
            int lch = k * 2 + 1;
            int rch = k * 2 + 2;
            init(lch, l, (l + r) / 2);
            init(rch, (l + r) / 2, r);
            segtree[k].resize(r - l);
            
            merge(segtree[lch].begin(), segtree[lch].end(), segtree[rch].begin(), segtree[rch].end(), segtree[k].begin());
        }
    }
    
    // number of x in [i, j)
    int query(int i, int j, i64 x, int k, int l, int r) {
        if (j <= l || r <= i) {
            return 0;
        }
        
        if (i <= l && r <= j) {
            return int(upper_bound(segtree[k].begin(), segtree[k].end(), x) - segtree[k].begin());
        }
        
        int lc = query(i, j, x, k * 2 + 1, l, (l + r) / 2);
        int rc = query(i, j, x, k * 2 + 2, (l + r) / 2, r);
        return lc + rc;
    }
    
public:
    RangeCount(vi v) {
        n = int(v.size());
        data = vi(v);
        segtree = vvi(ST_SIZE);
        init(0, 0, n);
    }
    
    int exact(int i, int j, i64 x) {
        return query(i, j, x, 0, 0, n) - query(i, j, x - 1, 0, 0, n);
    }
    
    int le(int i, int j, i64 x) {
        return query(i, j, x, 0, 0, n);
    }
    
    int lt(int i, int j, i64 x) {
        return query(i, j, x - 1, 0, 0, n);
    }
    
    int ge(int i, int j, i64 x) {
        return query(i, j, 1e18, 0, 0, n) - query(i, j, x - 1, 0, 0, n);
    }
    
    int gt(int i, int j, i64 x) {
        return query(i, j, 1e18, 0, 0, n) - query(i, j, x, 0, 0, n);
    }
};

int main() {
    int n;
    cin >> n;
    vi as, rs, ds;
    for (int i = 0; i < n; i++) {
        i64 a;
        cin >> a;
        as.push_back(a);
    }
    for (int i = 0; i < n; i++) {
        i64 l, r;
        cin >> l >> r;
        rs.push_back(r);
        ds.push_back(as[i] - l);
    }
    
    i64 ans = 0;
    RangeCount cnt(ds);
    for (int i = 0; i < n; i++) {
        i64 lim = as[i] + rs[i];
        int j = lower_bound(as.begin(), as.end(), lim + 1) - as.begin();
        ans += cnt.le(i + 1, j, as[i]);
    }
    cout << ans << endl;
}