#include #define rep(i,n)for(long long i=0;i<(long long)(n);++i) #define all(a) a.begin(), a.end() using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair P; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } const int MOD=1e9+7; const ll INF=1e18; const int MAX=510000; const double pi=acos(-1); int dx[8] = {1,0,-1,0,1,1,-1,-1}; int dy[8] = {0,1,0,-1,-1,1,1,-1}; int main(){ cin.tie(0); ios::sync_with_stdio(false); bool ok = false; vector s(3); rep(i,3) cin >> s[i]; rep(i,3){ int n = s[i].size(); int sum = 0; rep(j,n){ sum += s[i][j]-'0'; } if(sum % 3 == 0) ok = true; } if(ok) cout << "Yes"; else cout << "No"; return 0; }