#include <bits/stdc++.h>
using namespace std;
void c_p_c() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i += 6) {
    if (n % i == 0 || n % (i + 2) == 0) return false;
  }
  return true;
}
set<long long> Sieve(long long n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long i = 2; i * i <= n; i++) {
    if (prime[i]) {
      for (long long j = i * i; j <= n; j += i) {
        prime[j] = false;
      }
    }
  }
  set<long long> primes;
  for (long long i = 2; i <= n; i++) {
    if (prime[i]) {
      primes.insert(i);
    }
  }
  return primes;
}
long long primeFactors(long long n) {
  map<long long, long long> factors;
  while (n % 2 == 0) {
    n /= 2;
    factors[2]++;
    factors[2] %= 2;
  }
  for (long long i = 3; i <= sqrt(n); i += 2) {
    while (n % i == 0) {
      factors[i]++;
      factors[i] %= 2;
      n /= i;
    }
  }
  if (n > 2) factors[n]++;
  factors[n] %= 2;
  long long res = 1;
  for (auto d : factors) {
    if (d.second != 0) res *= d.first;
  }
  return res;
}
long long power(long long x, unsigned long long y) {
  long long res = 1;
  if (x == 0) return 0;
  ;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
unsigned long long gcd(unsigned long long a, unsigned long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool check(long long n, long long d) {
  long long prev = 1;
  set<long long> divisors;
  divisors.insert(1);
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      divisors.insert(i);
      divisors.insert(n / i);
    }
  }
  divisors.insert(n);
  for (long long x : divisors) {
    if (x == 1) continue;
    if (x - prev < d) {
      return false;
    }
    prev = x;
  }
  return true;
}
int32_t main() {
  c_p_c();
  long long n;
  cin >> n;
  long long sumx, sumy, sumz;
  sumx = sumy = sumz = 0;
  for (long long i = 0; i < n; i++) {
    long long x, y, z;
    cin >> x >> y >> z;
    sumx += x;
    sumy += y;
    sumz += z;
  }
  if (sumx != 0 || sumy != 0 || sumz != 0)
    cout << "NO" << '\n';
  else
    cout << "YES" << '\n';
}
