#include <iostream>
#include <string>        // string, to_string, stoi
#include <vector>        // vector
#include <algorithm>     // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility>       // pair, make_pair
#include <tuple>         // tuple, make_tuple
#include <cstdint>       // int64_t, int*_t
#include <cstdio>        // printf
#include <map>           // map
#include <queue>         // queue, priority_queue
#include <set>           // set
#include <stack>         // stack
#include <deque>         // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset>        // bitset
#include <cctype>        // isupper, islower, isdigit, toupper, tolower
#include <iomanip>       //setprecision
#include <math.h>
#include <functional>
#include <climits>
using namespace std;
template <typename T>
bool chmax(T &u, const T z)
{
    if (u < z)
    {
        u = z;
        return true;
    }
    else
        return false;
}
template <typename T>
bool chmin(T &u, const T z)
{
    if (u > z)
    {
        u = z;
        return true;
    }
    else
        return false;
}
#define ll long long
typedef pair<ll,ll> P;
const ll INF = 1LL << 60;
//const ll MOD=1000000007;
int MOD = 998244353;
#define rep(i,a, n) for (int i = a; i < (int)(n); ++i)
//using mint=modint1000000007;
int H, W;
vector<string> fi;
void chmin(int& t, int f) { if (f < t) t = f; }
ll dp[2][20000001];//０＝↑↑1＝➡➡2＝↑➡３＝➡↑
int op(int a,int b){
    return a^b;
}
int e(){
    return 0;
}
int main(){
    ll a,b,c;cin>>a>>b>>c;
    if((a+b+c)%3==0)cout<<"Yes";
    else cout<<"No"<<endl;
}