#include<iostream>
using namespace std;
const int N=100010;
int a[N], b[N];
int n;
int p, q;
void insert(int l, int r, int c)
{
    b[l] += c;
    b[r + 1] -= c;
}
int main()
{
    cin >> n;
    for(int i = 1; i <= n; ++ i) scanf("%d", &a[i]);
    for(int i = 1; i<= n; ++ i)
    {
        int t;
        scanf("%d", &t);
        a[i] -= t;
        insert(i, i, a[i]);
    }
    for(int i = 1; i <= n; ++ i)
    {
        if(b[i] > 0) p += b[i];
        else q -= b[i];
    }
    cout << max(p, q) << endl;
    return 0;
}