#include <bits/stdc++.h>
using namespace std;
int a[10];
int b[30] = {1};
void init()
{
    for (int i = 1; i <= 29; i++)
        b[i] = b[i - 1] * 2;
}
int main()
{
    int n, l = 0;
    init();
    scanf("%d", &n);
    while (n)
    {
        a[l++] = n % 10;
        n /= 10;
    }
    sort(a, a + l);
    do
    {
        if(a[0]==0)
          continue;
        int t = 0;
        for (int i = 0; i < l - 1; i++)
        {
            t += a[i];
            t *= 10;
        }
        t += a[l - 1];
        for (int i = 0; i <= 29; i++)
        {
            if (t == b[i])
            {
                printf("true\n");
                return 0;
            }
            else if (t < b[i])
                break;
        }
    } while (next_permutation(a, a + l));
    printf("false\n");
    return 0;
}