#include int main () { int n = 0; long long x[5000] = {}; long long a[5000] = {}; int res = 0; long long dp[5001] = {}; long long acc[5001] = {}; res = scanf("%d", &n); for (int i = 0; i < n; i++) { res = scanf("%lld", x+i); } for (int i = 0; i < n; i++) { res = scanf("%lld", a+i); acc[i+1] = acc[i]^a[i]; } for (int i = 0; i < n; i++) { dp[i+1] = 20000000000000000LL; } for (int i = 0; i < n; i++) { for (int j = i+1; j <= n; j++) { long long tmp = dp[i]+x[j-1]-x[i]+(acc[j]^acc[i]); if (dp[j] > tmp) { dp[j] = tmp; } } } printf("%lld\n", dp[n]); return 0; }