#include<bits/stdc++.h>
using namespace std ;

#define FASTIO ios::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
#define int long long
#define mod ((int)1e9 + 7)

void solve(){
        int n , ans = 0 ; cin >> n ; 
        vector<int> a(n) ;
        for(int& i : a) cin >> i ;
        for(int i = 0 ; i < n ; ++i){
                int x ; cin >> x ;
                ans += a[i] * x ;
        }
        cout << ((ans == 0) ? "Yes" : "No") << "\n" ;
}

signed main(){
        FASTIO
        int T = 1 ; 
       // cin >> T ;
        while(T--) solve() ;
        return 0 ;
}
#include <bits/stdc++.h>
using namespace std;
using i64 = unsigned long long;
#define rep(i, n) for (i64 i = 0; i < (n); i++)
#define IN_i64(n) \
    i64 n; \
    cin >> n;
#define IN_veci64(a, n) \
    vector<i64> a((n)); \
    rep(i, n) cin >> a[i];
constexpr i64 INF64 = 1LL << 62LL;
inline i64 modpow(i64, i64, i64 = INF64);
inline i64 gcd(i64, i64);
template <class T> inline bool chmax(T &a, T b);
template <class T> inline bool chmin(T &a, T b);


int main()
{
    IN_i64(N);
    IN_i64(K);
    rep(i,K){
        if (N%200==0) N/=200;
        else{
            N*=1000;
            N+=200;
        }
    }
    cout<<N<<endl;
}

i64 modpow(i64 base, i64 exp, i64 mod)
{
    i64 ans = 1;
    while (exp > 0)
    {
        if (exp % 2 == 1)
        {
            ans *= base;
            ans %= mod;
        }
        exp /= 2;
        base *= base;
        base %= mod;
    }
    return ans;
}

i64 gcd(i64 a, i64 b)
{
    if (b == 0) return a;
    return gcd(b, a % b);
}

template <class T> inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}

template <class T> inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
