#include <bits/stdc++.h>   using namespace std;   int n;   int t[60], v[60];   int main() {     scanf( %d , &n);     for (int i = 1; i <= n; i++) scanf( %d , &t[i]);     for (int i = 1; i <= n; i++) scanf( %d , &v[i]);     int nrOfStonesTakenAway = 0;     for (int i = 1; i <= n; i++) {       if (t[i] > v[i]) nrOfStonesTakenAway += (t[i] - v[i]);     }     for (int i = 1; i <= n; i++)       if (t[i] < v[i]) {         nrOfStonesTakenAway -= (v[i] - t[i]);       }     if (nrOfStonesTakenAway < 0)       puts( No );     else       puts( Yes );     return 0;   }   