#line 1 "1965.cpp" // #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt") // #pragma GCC optimize("Ofast") #line 2 "/home/sigma/comp/library/template.hpp" #include using namespace std; using ll = long long; using uint = unsigned int; using ull = unsigned long long; #define rep(i,n) for(int i=0;i=0;i--) #define per1(i,n) for(int i=int(n);i>0;i--) #define all(c) c.begin(),c.end() #define si(x) int(x.size()) #define pb push_back #define eb emplace_back #define fs first #define sc second template using V = vector; template using VV = vector>; template bool chmax(T& x, U y){ if(x bool chmin(T& x, U y){ if(y void mkuni(V& v){sort(all(v));v.erase(unique(all(v)),v.end());} template int lwb(const V& v, const T& a){return lower_bound(all(v),a) - v.begin();} template V Vec(size_t a) { return V(a); } template auto Vec(size_t a, Ts... ts) { return V(ts...))>(a, Vec(ts...)); } template ostream& operator<<(ostream& o,const pair &p){ return o<<"("< ostream& operator<<(ostream& o,const vector &vc){ o<<"{"; for(const T& v:vc) o< D divFloor(D a, D b){ return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0); } template D divCeil(D a, D b) { return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0); } #line 5 "1965.cpp" int main(){ cin.tie(0); ios::sync_with_stdio(false); //DON'T USE scanf/printf/puts !! cout << fixed << setprecision(20); int N; cin >> N; V A(N); rep(i,N) cin >> A[i]; V B(N); rep(i,N) cin >> B[i]; ll ans = 0; ll sz = 1; rep(i,N-1){ if(A[i]+B[i] < A[i+1]+B[i+1] && A[i]-B[i] < A[i+1]-B[i+1]){ sz++; }else{ ans += sz*(sz-1)/2; sz = 1; } } ans += sz*(sz-1)/2; cout << ans << endl; }