#include <bits/stdc++.h>
long long gcd(long long first, long long second) {
  return !second ? first : gcd(second, first % second);
}
long long lcm(long long first, long long second) {
  return (first / gcd(first, second)) * second;
}
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int M6 = 1e6 + 5, M5 = 1e5 + 5;
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, s1 = 0, s2 = 0;
  cin >> n;
  vector<int> v(n);
  vector<int> v1(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    s1 += v[i];
  };
  for (int i = 0; i < n; i++) {
    cin >> v1[i];
    s2 += v1[i];
  };
  if (s2 <= s1)
    cout << "Yes" << '\n';
  else
    cout << "NO" << '\n';
}
