S = input()


def solve():
    ds = [int(c) for c in reversed(S)]

    def rec(p, ca):
        if p == len(ds): return True

        for i in range(10):   # 割り当てる数字
            x = i*i + ca
            if ds[p] == x % 10:
                ok = rec(p+1, x // 10)
                if ok: return True

        return False

    return rec(0, 0)


if solve():
    print('YES')
else:
    print('NO')