#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 10000;
const ll nmax = 8;
const ll INF = 1e9;

class UnionFind
{
public:
    vector<ll> Parent;

    UnionFind(ll N)
    {
        Parent = vector<ll>(N, -1);
    }
    ll find(ll A)
    {
        if (Parent[A] < 0)
            return A;
        return Parent[A] = find(Parent[A]);
    }

    ll size(ll A)
    {
        return -Parent[find(A)];
    }

    bool Union(ll A, ll B)
    {
        A = find(A);
        B = find(B);
        if (A == B)
        {
            return false;
        }
        if (size(A) < size(B))
            swap(A, B);

        Parent[A] += Parent[B];
        Parent[B] = A;

        return true;
    }
};

ll gcd(ll a, ll b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b)
{
    ll g = gcd(a, b);
    return a / g * b;
}

ll mulMod(ll a, ll b)
{
    return (((a % MOD) * (b % MOD)) % MOD);
}

ll powMod(ll a, ll p)
{
    if (p == 0)
    {
        return 1;
    }
    else if (p % 2 == 0)
    {
        ll half = powMod(a, p / 2);
        return mulMod(half, half);
    }
    else
    {
        return mulMod(powMod(a, p - 1), a);
    }
}

ll ceil(ll a, ll b)
{
    return (a + b - 1) / b;
}

bool isOK(map<char, ll> cnter, ll cnt, ll K, char c)
{
    if (cnt == K)
    {
        if (cnter[c] >= 1)
        {
            return true;
        }
        else
        {
            return false;
        }
    }
    else if (cnt == K - 1)
    {
        if (cnter[c] == 0)
        {
            return true;
        }
    }
    return false;
}

ll dp[5050][5050];
vector<ll> cake(5050);
ll f(int left, int right)
{
    if (dp[left][right] != -1)
    {
        return dp[left][right];
    }

    if (left == right)
    {
        return dp[left][right] = cake[left];
    }
    if (left + 1 == right)
    {
        return dp[left][right] = max(cake[left], cake[right]);
    }

    ll ret = -1;

    if (cake[left + 1] < cake[right])
    {
        ret = max(ret, cake[left] + f(left + 1, right - 1));
    }
    else
    {
        ret = max(ret, cake[left] + f(left + 2, right));
    }

    if (cake[left] < cake[right - 1])
    {
        ret = max(ret, cake[right] + f(left, right - 2));
    }
    else
    {
        ret = max(ret, cake[right] + f(left + 1, right - 1));
    }
    return dp[left][right] = ret;
}
int main()
{
    ll N;
    cin >> N;
    if (N % 6 == 0)
    {
        cout << "Yes" << endl;
    }
    else
    {
        cout << "No" << endl;
    }
    return 0;
}