import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


void add(long[] bit, int pos, long val) {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}
long rangeSum(long[] bit, int pos) {
  long ret;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}


int N;
long[] A;
long[] L, R;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      L = new long[N];
      R = new long[N];
      foreach (i; 0 .. N) {
        L[i] = readLong();
        R[i] = readLong();
      }
      
      Tuple!(long, int, int)[] entries;
      foreach (i; 0 .. N) {
        entries ~= tuple(L[i], i, 0);
        entries ~= tuple(R[i], i, 1);
      }
      entries.sort;
      
      auto bitL = new long[N];
      auto bitR = new long[N];
      long ans;
      foreach (entry; entries) {
        const i = entry[1];
        switch (entry[2]) {
          case 0: {
            const j = A.lowerBound(A[i] - L[i]);
            ans += (i - j) - (bitR.rangeSum(i) - bitR.rangeSum(j));
            bitL.add(i, 1);
          } break;
          case 1: {
            const j = A.upperBound(A[i] + R[i]);
            ans += (j - (i + 1)) - (bitL.rangeSum(j) - bitL.rangeSum(i + 1));
            bitR.add(i, 1);
          } break;
          default: assert(false);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}