#include #include #include #include #include #define rep(i,n) for (int i = 0; i < (n); ++i) using ll = long long; typedef long double ld; using namespace std; ll gcd(ll P, ll Q){ return Q ? gcd(Q,P % Q):P; } ll lcm(ll P, ll Q){ return P / gcd(P,Q) * Q; } int main() { int N; cin >> N; if(N % 6 == 0){ cout << "Yes" << endl; } else{ cout << "No" << endl; } return 0; }