Problem:
Score : 200 points

Problem Statement

An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.

Determine whether N is a multiple of 9.

Constraints

0 \leq N < 10^{200000}

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If N is a multiple of 9, print Yes; otherwise, print No.

Sample Input 1

123456789

Sample Output 1

Yes

The sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.

Sample Input 2

0

Sample Output 2

Yes

Sample Input 3

31415926535897932384626433832795028841971693993751058209749445923078164062862089986280

Sample Output 3

No

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#define F first;
#define S second;
#define PB(x) push_back(x);
#define MP make_pair;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
template <typename T>
T max(T x, T y)
{
    return (x > y) ? x : y;
}
template <typename T>
T min(T x, T y)
{
    return (x < y) ? x : y;
}
const int M = 1e9 + 7;
bool isMulOf9(long long n)
{
    // Base cases
    if (n == 0 || n == 9)
        return true;
    if (n < 9)
        return false;

    // if the number is greater than 9, then do this
    return isMulOf9((long long)(n >> 3) - (long long)(n & 7));
}
void solve()
{
    long long N;
    cin >> N;
    if (isMulOf9(N))
        cout << "Yes" << endl;
    else
    {
        cout << "No" << endl;
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}