#include <iostream>
#include <fstream>

using namespace std;
const int MOD = 100019,
          NMAX = 10001;

ifstream f("puteri2.in");
ofstream g("puteri2.out");

int A[NMAX];

long long powlg(long long a, long long p)
{
    long long val = 1, x = a % MOD;
    while(p > 0)
        if(p % 2 == 0)
        {
            x = x * x % MOD;
            p /= 2;
        }
        else
        {
            val = val * x % MOD;
            p--;
        }
    return val;
}
int main()
{
    int n, b, i;
    long long sum = 0;
    f >> n;
    for(i = 1; i <= n; i++)
        f >> A[i];
    for(i = 1; i <= n; i++)
    {
        f >> b;
        sum += powlg(A[i], b);
    }
    g << sum % MOD;
    return 0;
}