
// Problem : B - Orthogonality
// Contest : AtCoder - AtCoder Beginner Contest 188
// URL : https://atcoder.jp/contests/abc188/tasks/abc188_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000009
#define rep(i,n) for (ll i = 0; i < n; i++)
#define  pb push_back
#define mp make_pair

 int main(){
    ios::sync_with_stdio(false);
  cin.tie(0);
  ll n;
  cin>>n;
  ll ans = 0;ll a[n];ll b[n];
  rep(i,n){
  	cin>>a[i];
  	  }
  	  rep(i,n){
  	cin>>b[i];
  	  }
  	  rep(i,n){
  	  	ans += (a[i]*b[i]);
  	  }
  	  if(ans==0){cout<<"Yes"<<endl;}
  	  else{
  	  	cout<<"No"<<endl;
  	  }
     }
     
 
#include <bits/stdc++.h>
using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	string s; cin >> s;
	if( s[0] == s[1] && s[0] == s[2] ){
		cout << "Won\n";
	}
	else{
		cout << "Lost\n";
	}
}
