using System;
using System.Linq;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using static System.Console;
using static Program.Input;
using static Program.MyMath;
using static Program.Const;

namespace Program
{
    static class Const
    {
        public static string alp = "abcdefghijklmnopqrstuvwxyz";
        public static string Alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
        public const long MOD = 1000000007;
        public static int INF = int.MaxValue;
        public static long INFL = long.MaxValue;
    }
    class Program
    {
        static void Main()
        {
            var num = int.Parse(ScanStrArray().Join(""));
            WriteLine(Solve(num) ? "Yes" : "No");
        }
        static bool Solve(int num)
        {
            int p = 1;
            while (true)
            {
                if (p * p == num) return true;
                if (p * p > num) return false;
                p++;
            }
        }
        public class PriorityQueue
        {
            private int[] heap;
            private int sz = 0;

            public PriorityQueue(int size) { heap = new int[size]; }

            public void Enqueue(int x)
            {
                var i = sz++;

                while (i > 0)
                {
                    var p = (i - 1) / 2;
                    if (heap[p] >= x) break;
                    heap[i] = heap[p];
                    i = p;
                }

                heap[i] = x;
            }

            public int Dequeue()
            {
                int ret = heap[0];
                int x = heap[--sz];
                int i = 0;
                while (i * 2 + 1 < sz)
                {
                    int a = i * 2 + 1;
                    int b = i * 2 + 2;

                    if (b < sz && b < a) a = b;

                    if (heap[a] <= x) break;

                    heap[i] = heap[a];
                    i = a;
                }

                heap[i] = x;

                return ret;
            }
        }
    }

    static class Input
    {
        public static void InputLine(out int a, out int b) { var arr = ScanIntArray(); a = arr[0]; b = arr[1]; }
        public static void InputLine(out int a, out int b, out int c) { var arr = ScanIntArray(); a = arr[0]; b = arr[1]; c = arr[2]; }
        public static void InputLine(out long a, out long b) { var arr = ScanLongArray(); a = arr[0]; b = arr[1]; }
        public static void InputLine(out long a, out long b, out long c) { var arr = ScanLongArray(); a = arr[0]; b = arr[1]; c = arr[2]; }
        public static void InputLine(out string a, out string b) { var arr = ScanStrArray(); a = arr[0]; b = arr[1]; }
        public static void InputLine(out string a, out string b, out string c) { var arr = ScanStrArray(); a = arr[0]; b = arr[1]; c = arr[2]; }
        static public int ScanInt() { return int.Parse(ReadLine()); }
        static public long ScanLong() { return long.Parse(ReadLine()); }
        static public double ScanDouble() { return double.Parse(ReadLine()); }
        static public int[] ScanIntArray() { return ReadLine().Split().Select(x => int.Parse(x)).ToArray(); }
        static public long[] ScanLongArray() { return ReadLine().Split().Select(x => long.Parse(x)).ToArray(); }
        static public double[] ScanDoubleArray() { return ReadLine().Split().Select(x => double.Parse(x)).ToArray(); }

        static public string ScanStr() { return ReadLine(); }
        static public string[] ScanStrArray() { return ScanStr().Split(); }
        static public string RegaxReplace(this string arg1, string pattern, string replacement) { return Regex.Replace(arg1, pattern, replacement); }
        static public string Join<T>(this IEnumerable<T> source, string separator) { return string.Join(separator, source); }
        static public void Sort(this string[] array) { Array.Sort(array, StringComparer.OrdinalIgnoreCase); }
        static public void StringSort(this List<string> list) { list.Sort(StringComparer.OrdinalIgnoreCase); }
        public static Dictionary<char, int> alpToIdx = Enumerable.Range(0, alp.Length).ToDictionary(_ => alp[_], _ => _);
        public static Dictionary<char, int> AlpToIdx = Enumerable.Range(0, Alp.Length).ToDictionary(_ => Alp[_], _ => _);
    }

    static class MyMath
    {
        static public int CountBit(this long a)
        {
            if (a == 0) return 0;
            int c = 1;
            for (; a>1; a/=2) if (a % 2 == 1) c++;
            return c;
        }
        static public int Floor2(this int a) { int N = 1; while (N < a) N *= 2; return N / 2; }
        static public long Floor2(this long a) { long N = 1; while (N < a) N *= 2; return N / 2; }
        static public int Ceiling2(this int a) { int N = 1; while (N < a) N *= 2; return N; }
        static public long Ceiling2(this long a) { long N = 1; while (N < a) N *= 2; return N; }
        static public long[] CumSum(this long[] a) { var res = new long[a.Length]; long s = 0; for (int i = 0; i < a.Length; i++) res[i] = (s += a[i]); return res; }
        static public IEnumerable<int> PrimeFactors(this int n)
        {
            int tmp = n;
            for (int i = 2; i * i <= n; i++)
            {
                while (tmp % i == 0)
                {
                    tmp /= i;
                    yield return i;
                }
            }
            if (tmp != 1) yield return tmp;
        }
        static public IEnumerable<long> PrimeFactors(this long n)
        {
            var tmp = n;
            for (long i = 2; i * i <= n; i++)
            {
                while (tmp % i == 0)
                {
                    tmp /= i;
                    yield return i;
                }
            }
            if (tmp != 1) yield return tmp;
        }
        static public int Digit(this int n, int d) { if (d < 0) return 0; return (n % (int)Math.Pow(10, d + 1)) / (int)Math.Pow(10, d); }
        static public int Length(this int n) { if (n < 0) return 0; return (int)Math.Log10(n) + 1; }
        static public int Top(this int n) { return n.Digit(n.Length() - 1); }
        public static bool isPrime(this int p)
        {
            if (p <= 1) return false;
            for (int i = 2; i * i <= p; i++)
                if (p % i == 0) return false;
            return true;
        }
        public static bool isPrime(this long p)
        {
            if (p <= 1) return false;
            for (long i = 2; i * i <= p; i++)
                if (p % i == 0) return false;
            return true;
        }
        public static int GCD(int a, int b)
        {
            Func<int, int, int> gcd = null;
            gcd = (x, y) => y == 0 ? x : gcd(y, x % y);
            return a > b ? gcd(a, b) : gcd(b, a);
        }
        public static long GCD(long a, long b)
        {
            Func<long, long, long> gcd = null;
            gcd = (x, y) => y == 0 ? x : gcd(y, x % y);
            return a > b ? gcd(a, b) : gcd(b, a);
        }
        public static ulong extGCD(ulong a, ulong b, ref ulong x, ref ulong y)
        {
            if (b == 0)
            {
                x = 1;
                y = 0;
                return a;
            }
            var d = extGCD(b, a % b, ref y, ref x);
            y -= a / b * x;
            return d;
        }
        public static int LCM(int a, int b) { return a * b / GCD(a, b); }
        public static long LCM(long a, long b) { return a * b / GCD(a, b); }
        public static long Inv(this long a, long m = MOD)
        {
            long b = m, u = 1, v = 0;
            while (b != 0)
            {
                long t = a / b;
                a -= t * b;
                swap(ref a, ref b);
                u -= t * v;
                swap(ref u, ref v);
            }
            u %= m;
            if (u < 0) u += m;
            return u;
        }
        private static void swap(ref long a, ref long b)
        {
            var t = a;
            a = b;
            b = t;
        }
        public static long ModPow(long a, long n, long m = MOD)
        {
            long res = 1;
            while (n > 0)
            {
                if (n % 2 == 1) res = (res * a) % m;
                a = (a * a) % m;
                n >>= 1;
            }
            return res;
        }

    }


}


Measured memory_bytes: 13280