#include "bits/stdc++.h" #define REP(i, n, N) for(ll i=(n); i<(N); i++) #define RREP(i, n, N) for(ll i=(N-1); i>=n; i--) #define CK(n, a, b) ((a)<=(n)&&(n)<(b)) #define ALL(v) (v).begin(),(v).end() #define MCP(a, b) memcpy(b,a,sizeof(b)) #define p(s) cout<<(s)<> typedef long long ll; using namespace std; const ll mod = 1e9 + 7; const ll inf = 1e18; int n; int a[110], b[110], c[110]; int ans, sum; int main() { cin>>n; REP(i,0,n-1) cin>>a[i]; REP(i,0,n) cin>>b[i]>>c[i]; sum = c[0]; REP(i,0,n-1){ ans += a[i] * sum; sum+=(c[i+1]-b[i+1]); } p(ans); return 0; }