import java.util.Arrays;

public class Main {


  private static void solve() {
    int n = ni();
    int[] a = na(n);
    int[][] r = ntable(n, 2);
    int[] ft = new int[n + 1];

    int[][] b = new int[n * 2][];
    for (int i = 0; i < n; i ++) {
      b[i * 2 + 0] = new int[] {a[i], i, 0};
      b[i * 2 + 1] = new int[] {a[i] - r[i][0], i, 1};
    }
    Arrays.sort(b, (o1, o2) -> o1[0] == o2[0] ? o2[2] - o1[2] : o1[0] - o2[0]);

    long ret = 0;
    for (int i = 0; i < n * 2; i ++) {
      int j = b[i][1];
      if (b[i][2] == 1) {
        addFenwick(ft, j, 1);
      } else {
        int k = Arrays.binarySearch(a, b[i][0] + r[j][1]);
        if (k < 0) k = -k - 2;
        
        ret += sumFenwick(ft, k) - sumFenwick(ft, j);
      }
    }
    System.out.println(ret);
  }

  public static int sumFenwick(int[] ft, int i)
  {
      int sum = 0;
      for(i++;i > 0;i -= i&-i)sum += ft[i];
      return sum;
  }
  
  public static void addFenwick(int[] ft, int i, int v)
  {
      if(v == 0 || i < 0)return;
      int n = ft.length;
      for(i++;i < n;i += i&-i)ft[i] += v;
  }
  
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}