#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>

#define rep(i,n) for(i=0; i<n; ++i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
using namespace std;
using lint = long long;

lint add(lint n){
    if(n==0)    return 0;
    else    return add(n-1) + n;
}

int main(void){
    lint i, j, n, m, k, cnt = 0;
    in(n);
    vector<lint> A(n);
    vector<lint> B(n);
    rep(i,n)    in(A[i]);
    rep(i,n)    in(B[i]);
    vector<lint> dis_A(n-1);
    vector<lint> dis_B(n-1);
    rep(i,n-2)  dis_A[i]=A[i+1]-A[i];
    rep(i,n-2)  dis_B[i]=B[i+1]-B[i];
    int left, right;
    i = 0;
    while(i<n-1){
        if(abs(dis_B[i])<dis_A[i]){
            j=i;
            cnt++;
            while(j<n-1){
                j++;
                cnt++;
                if(abs(dis_B[j])>dis_A[j]){
                    break;
                }
                right = j;
            }
            // cout << right;
            // cnt+=add(right-i);
            for(int k=1; k<right-i+1; ++k){
                for(int l=i; l<right-k; ++l){
                    if(abs(dis_B[l+k]-dis_B[l])<dis_A[l+k]-dis_A[l])    cnt++;
                }
            }
            i=j+1;
        }
        else        i++;
    }
    out(cnt,endl);
    return 0;
}