#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
bool prime[10000];
void era() {
  memset(prime, true, sizeof prime);
  for (long long int p = 2; p * p <= 10000; p++) {
    if (prime[p]) {
      for (long long int q = p * p; q <= 10000; q += p) {
        prime[q] = false;
      }
    }
  }
  return;
}
long long int fac[200001], finv[200001];
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % 1000000007;
    b /= 2;
    a = (a * a) % 1000000007;
  }
  return (ans % 1000000007);
}
long long int inverse(long long int a) {
  return ((power(a, 1000000007 - 2)) % 1000000007);
}
long long int ncr(long long int n, long long int r) {
  long long int p1 = finv[n - r];
  long long int p2 = finv[r];
  return ((((fac[n] * p1) % 1000000007) * p2) % 1000000007);
}
bool solve(long long int n, long long int arr[]) {
  long long int sum = 0;
  for (long long int i = 0; i < n; i++) {
    sum += arr[i];
    if (sum <= 0) return (false);
  }
  sum = 0;
  for (long long int i = n - 1; i >= 0; i--) {
    sum += arr[i];
    if (sum <= 0) return (false);
  }
  return (true);
}
struct Node {
  long long int l, r, w;
} arr[5001];
bool cmp(Node a, Node b) { return (a.r < b.r); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int a, b, c;
  cin >> a >> b >> c;
  if ((a + b + c) % 3 == 0)
    cout << "Yes";
  else
    cout << "No";
  return (0);
}
