#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1000000009;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
	llint ans=0,i,n,bas;cin>>n;
	vector<llint>ie(n);
	vector<llint>Lg(n);
	vector<llint>Rg(n);
	for(i=0;i<n;i++){cin>>ie[i];}
	for(i=0;i<n;i++){cin>>Lg[i]>>Rg[i];}
	//セグメントつりー!
	static int seg[1048576]={0};
	int nko=0;
	priority_queue<pair<llint,int>,vector<pair<llint,int>>,greater<pair<llint,int>>>que;
	for(i=0;i<n;i++){
		while(que.size()>0&&que.top().fir<ie[i]){
			int bas=(1<<19)+que.top().sec;nko--;
			while(bas>1){seg[bas]--;bas/=2;}
			que.pop();
		}
		bas=(1<<19)+LBI(ie,ie[i]-Lg[i]);
		while(bas>1){if(bas%2==1){ans-=seg[bas-1];}bas/=2;}
		ans+=nko;nko++;
		bas=(1<<19)+i;
		que.push(mp(ie[i]+Rg[i],i));
		while(bas>1){seg[bas]++;bas/=2;}
	}
	cout<<ans<<endl;
	return 0;
}