n = int(input())

a = list(map(int, input().split()))
b = list(map(int, input().split()))
t = 0
for i in range(n):
t += a[i]**b[i]
print(t)

Nice try =))))))

tôi là anh đẹp zai

include <bits/stdc++.h>

using namespace std;
using ll=long long;
int n,q;
int x,k;
ll chan=0,le=0;
int cmp=0;
int main()
{
cin >> n >> q;
vector<int> v(n);
for(int &x : v) cin >> x;
for(int x : v){
if(x&1) le+=x;
else{
chan+=x;cmp++;
}
}
while(q--){
cin >> k >> x;
if(k&1) chan+= cmpx;
else le+=(n-cmp)x;
cout << chan+le<<endl;
}
}

include <bits/stdc++.h>

include <math.h>

include <iomanip>

include <iostream>

using namespace std;
bool canAttack(int x1, int y1, int x2, int y2) {
int dx = abs(x1 - x2);
int dy = abs(y1 - y2);
return (dx == 2 && dy == 1) || (dx == 1 && dy == 2);

}

int main() {
int n;
cin >> n;

for (int k = 1; k <= n; k += 1) {
    long long totalWays = 0;
    long long attackingWays = 0;

    for (int i = 0; i < k; ++i) {
        for (int j = 0; j < k; ++j) {

            for (int x = 0; x < k; ++x) {
                for (int y = 0; y < k; ++y) {

                    if (i < x || (i == x && j < y)) {
                        totalWays += 1;
                        if (canAttack(i, j, x, y)) {
                            attackingWays += 1;
                        }
                    }
                }
            }
        }
    }

    long long nonAttackingWays = totalWays - attackingWays;
    cout << nonAttackingWays << endl;
}

return 0;

}

include<bits/stdc++.h>

define ll long long

define pb push_back

define fi first

define se second

pragma GCC optimize("03,unroll-loops")

pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

const int MOD = 1e9 + 7;
const int maxN = 1e3 + 1;

void solve()
{
int n;
cin >> n;
int a[n];
for (int i=1; i<=n; ++i) cin >> a[i];
int dp[n+1];
dp[0] = dp[1] = 0;
for (int i=2; i<=n; ++i)
{
dp[i] = min(dp[i-1] + abs(a[i] - a[i-1]), dp[i-2] + abs(a[i] - a[i-2]));
}
cout << dp[n];
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t;
t=1;
while (t--)
{
solve();
}
}