A water problem

Problem Description

Two planets named Haha and Xixi in the universe and they were created with the universe beginning.

There is 73 days in Xixi a year and 137 days in Haha a year. 

Now you know the days N after Big Bang, you need to answer whether it is the first day in a year about the two planets.

 

Input

There are several test cases(about 5 huge test cases).

For each test, we have a line with an only integer N(0≤N), the length of N is up to 10000000.

 

Output

For the i-th test case, output Case #i: , then output "YES" or "NO" for the answer.

 

Sample Input

10001

0

333

 

Sample Output

Case #1: YES

Case #2: YES

Case #3: NO

大整数取余。对10001取余，10001是73和137的最小公倍数。

#include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
#define N 10500000
typedef long long LL;
int a[N],b[N];
int len;

int main()
{


    int i=1;
    char str[N];
    while(scanf("%s", str) != EOF)
    {

        int d = 10001;
        int ans = 0;
        for(int j = 0; str[j]; j++)
            ans = (ans * 10 + (str[j] - '0') % d) % d;


        if( ans == 0)
            printf("Case #%d: YES
", i++);
        else
            printf("Case #%d: NO
", i++);
    }
    return 0;
}