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 Rust (1.42.0) (judge verdict: Accepted)

use text_io::*;
use std::collections::*;
use std::process::exit;
use std::cmp::*;

fn main() {
    let mut n:String = read!();
    let v:Vec<char> = n.chars().collect();
    let mut a:usize = 0;
    for i in 0..v.len() {
        if v[i]=='0' {a+=0; }
        if v[i]=='1' {a+=1; }
        if v[i]=='2' {a+=2; }
        if v[i]=='3' {a+=3; }
        if v[i]=='4' {a+=4; }
        if v[i]=='5' {a+=5; }
        if v[i]=='6' {a+=6; }
        if v[i]=='7' {a+=7; }
        if v[i]=='8' {a+=8; }
        if v[i]=='9' {a+=9; }
    }
    if a%9==0 {
        println!("Yes");
    }
    else {
        println!("No");
    }
}