// Sonny's solution to divisibility
// Stanford Local Programming Contest, October 2007

#include <iostream>
#include <string>
#include <locale>

using namespace std;

inline int convert(char c)
{
    if (isdigit(c))      return c-'0';
    else if (isupper(c)) return c-'A' + 10;
    else                 return c-'a' + 36;
}

int main()
{
    string s;
    while (cin >> s)
    {
        if (s == "end") break;
        
        // sum the digits
        int sum = 0;
        for (string::iterator it = s.begin(); it != s.end(); ++it)
            sum += convert(*it);
        
        // number is divisible by 61 if sum of digits is divisible by 61
        if (sum % 61)   cout << "no" << endl;
        else            cout << "yes" << endl;
    }

    return 0;
}