#include "bits/stdc++.h" using namespace std; #define Rep(i,n) for(int i=0;i<(int)(n);i++) #define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++) #define REP(i,n) for(ll i=0;i<(ll)(n);i++) #define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--) #define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++) #define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--) #define all(a) (a).begin(),(a).end() #define SORT(a) sort((a).begin(),(a).end()) #define oorret 0 #define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}() #define IOS cin.tie(0),ios::sync_with_stdio(false) typedef long long ll; typedef unsigned long long ull; typedef std::pair P; template inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; } template inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; } templatestruct is_vector : std::false_type {}; templatestruct is_vector> : std::true_type {}; template inline std::ostream& operator << (std::ostream& out, const std::vector& v) { if (v.empty())return out; constexpr bool is_vector_v = is_vector::value; if (is_vector_v)for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? "\n" : ""); else for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? " " : ""); return out; } inline void put() {} template inline void put(const T& first) { std::cout << first << "\n"; } template inline void put(const T& first, const N& ... rest) { std::cout << first << " "; put(rest...); } inline void putn() {} template inline void putn(const T& first, const N& ... rest) { std::cout << first << "\n"; putn(rest...); } int main() { IOS; int n; cin >> n; if (n % 6 == 0) { put("Yes"); } else { put("No"); } return 0; }