def floor_sqrt(n):
  if n<0:
    return -1
  ng,ok=n+1,-1
  while ng-ok>1:
    mid=(ok+ng)//2
    if mid*mid<=n:
      ok=mid
    else:
      ng=mid
  return ok

n=int(input())
for i in range(10**5):
  if i*i<n:
    s=floor_sqrt(n-i*i)
    if i*i+s*s==n:
      print('Yes')
      exit()
print('No')