#include<cstdio>

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<queue>

 #include<map>

 using namespace std;

 #define MOD 1000000007

 const int INF=0x3f3f3f3f;

 const double eps=1e-;

 typedef long long ll;

 #define cl(a) memset(a,0,sizeof(a))

 #define ts printf("*****\n");

 const int MAXN=;

 int m,tt;

 bool sg[MAXN];

 void fun(int n)

 {

     int i,j,k;

     char ss[];

     sprintf(ss,"%d",n);

     int len=strlen(ss);

     for(i=;i<len;i++)  //在每位上添加数字

     {

         int temp=n;

         char tss[];

         strcpy(tss,ss);

         while(tss[i]<'')

         {

             tss[i]+=;

             sscanf(tss,"%d",&temp);

             sg[temp]=;

         }

     }

     if(len!=)

     {

         int temp=n;

         int base=;

         for(i=len;i<;i++)

         {

             temp*=;

             for(j=;j<base;j++)

             {

                 sg[temp+j]=;

             }

             base*=;

         }

     }

 }

 void init()

 {

     sg[]=;

     for(int i=;i<MAXN;i++)

     {

         if(!sg[i])

         {

             fun(i);

         }

     }

 }

 int main()

 {

     int i,j,k,ca=;

     #ifndef ONLINE_JUDGE

     freopen("1.in","r",stdin);

     #endif

     cl(sg);

     init();

     char s[];

     while(scanf("%s",s)!=EOF)

     {

         int n=;

         if(s[]=='')

         {

             printf("Yes\n");

             continue;

         }

         int len=strlen(s);

         for(i=;i<len;i++)

         {

             n*=;

             n+=s[i]-'';

         }

         if(sg[n])   printf("Yes\n");

         else printf("No\n");

     }

 }