import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;
 

//result = Math.pow(num1, num3)
//StringBuffer str = new StringBuffer(hoge1);
//String hoge2 = str.reverse().toString();
//map.containsKey(A)

//Map<String, Integer> map = new HashMap<String, Integer>(n);
/*for ( キーのデータ型 key : マップの名前.keySet() ) {
	データのデータ型 data = マップの名前.get( key );
	
	// keyやdataを使った処理;
}*/
//int i = Integer.parseInt(s);
//Queue<String> qq=new ArrayDeque<>(); //add,poll,peek
//Deque<String> qq=new ArrayDeque<>();//push,pop,peek
//ArrayList<String> cc = new ArrayList<>(n);
//Collections.sort(list);
//Array.sort(list);
//Arrays.asList(c).contains("a")
//list.set(1,"walk");
public class Main {
	static int a1[]= {0,-1,0,1};
	static int b1[]= {-1,0,1,0};
	private static Scanner sc = new Scanner(System.in);
	static void p(String ans) {System.out.println(ans);};
	static void p(int ans) {System.out.println(ans);};
	static void p(long ans) {System.out.println(ans);};
	static void p(double ans) {System.out.println(ans);};
	static int K;
	public static void main(String[] args) {
		String H=sc.next();
		String W=sc.next();
		
		int N=Integer.parseInt(H+W);
		boolean a=false;
		for(int i=1;Math.pow(i, 2)<=N;i++) {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		}
		if(a) {
			p("Yes");
		}else {
			p("No");
		}
		//p((double)H*W/2);
		
	}
} import java.util.ArrayDeque; ArrayDeque java.util import java.util.ArrayList; ArrayList java.util import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.HashMap; HashMap java.util import java.util.Map; Map java.util import java.util.Queue; Queue java.util import java.util.Scanner; Scanner java.util public class Main {
	static int a1[]= {0,-1,0,1};
	static int b1[]= {-1,0,1,0};
	private static Scanner sc = new Scanner(System.in);
	static void p(String ans) {System.out.println(ans);};
	static void p(int ans) {System.out.println(ans);};
	static void p(long ans) {System.out.println(ans);};
	static void p(double ans) {System.out.println(ans);};
	static int K;
	public static void main(String[] args) {
		String H=sc.next();
		String W=sc.next();
		
		int N=Integer.parseInt(H+W);
		boolean a=false;
		for(int i=1;Math.pow(i, 2)<=N;i++) {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		}
		if(a) {
			p("Yes");
		}else {
			p("No");
		}
		//p((double)H*W/2);
		
	}
} Main static int a1[]= {0,-1,0,1}; a1 {0,-1,0,1} 0 -1 1 0 1 static int b1[]= {-1,0,1,0}; b1 {-1,0,1,0} -1 1 0 1 0 private static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) static int K; K static void p(String ans) {System.out.println(ans);} p {System.out.println(ans);} System.out.println(ans) System.out.println System.out System System.out ans String ans ans static void p(int ans) {System.out.println(ans);} p {System.out.println(ans);} System.out.println(ans) System.out.println System.out System System.out ans int ans ans static void p(long ans) {System.out.println(ans);} p {System.out.println(ans);} System.out.println(ans) System.out.println System.out System System.out ans long ans ans static void p(double ans) {System.out.println(ans);} p {System.out.println(ans);} System.out.println(ans) System.out.println System.out System System.out ans double ans ans public static void main(String[] args) {
		String H=sc.next();
		String W=sc.next();
		
		int N=Integer.parseInt(H+W);
		boolean a=false;
		for(int i=1;Math.pow(i, 2)<=N;i++) {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		}
		if(a) {
			p("Yes");
		}else {
			p("No");
		}
		//p((double)H*W/2);
		
	} main {
		String H=sc.next();
		String W=sc.next();
		
		int N=Integer.parseInt(H+W);
		boolean a=false;
		for(int i=1;Math.pow(i, 2)<=N;i++) {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		}
		if(a) {
			p("Yes");
		}else {
			p("No");
		}
		//p((double)H*W/2);
		
	} String H=sc.next(); H sc.next() sc.next sc String W=sc.next(); W sc.next() sc.next sc int N=Integer.parseInt(H+W); N Integer.parseInt(H+W) Integer.parseInt Integer H+W H W boolean a=false; a false for(int i=1;Math.pow(i, 2)<=N;i++) {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		} int i=1; int i=1; i 1 Math.pow(i, 2)<=N Math.pow(i, 2) Math.pow Math i 2 N i++ i++ i {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		} {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		} if(Math.pow(i, 2)==N) {
				a=true;
			} Math.pow(i, 2)==N Math.pow(i, 2) Math.pow Math i 2 N {
				a=true;
			} a=true a true if(a) {
			p("Yes");
		}else {
			p("No");
		} a {
			p("Yes");
		} p("Yes") p "Yes" {
			p("No");
		} p("No") p "No" String[] args args public class Main {
	static int a1[]= {0,-1,0,1};
	static int b1[]= {-1,0,1,0};
	private static Scanner sc = new Scanner(System.in);
	static void p(String ans) {System.out.println(ans);};
	static void p(int ans) {System.out.println(ans);};
	static void p(long ans) {System.out.println(ans);};
	static void p(double ans) {System.out.println(ans);};
	static int K;
	public static void main(String[] args) {
		String H=sc.next();
		String W=sc.next();
		
		int N=Integer.parseInt(H+W);
		boolean a=false;
		for(int i=1;Math.pow(i, 2)<=N;i++) {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		}
		if(a) {
			p("Yes");
		}else {
			p("No");
		}
		//p((double)H*W/2);
		
	}
} public class Main {
	static int a1[]= {0,-1,0,1};
	static int b1[]= {-1,0,1,0};
	private static Scanner sc = new Scanner(System.in);
	static void p(String ans) {System.out.println(ans);};
	static void p(int ans) {System.out.println(ans);};
	static void p(long ans) {System.out.println(ans);};
	static void p(double ans) {System.out.println(ans);};
	static int K;
	public static void main(String[] args) {
		String H=sc.next();
		String W=sc.next();
		
		int N=Integer.parseInt(H+W);
		boolean a=false;
		for(int i=1;Math.pow(i, 2)<=N;i++) {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		}
		if(a) {
			p("Yes");
		}else {
			p("No");
		}
		//p((double)H*W/2);
		
	}
} Main
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;
 

//result = Math.pow(num1, num3)
//StringBuffer str = new StringBuffer(hoge1);
//String hoge2 = str.reverse().toString();
//map.containsKey(A)

//Map<String, Integer> map = new HashMap<String, Integer>(n);
/*for ( キーのデータ型 key : マップの名前.keySet() ) {
	データのデータ型 data = マップの名前.get( key );
	
	// keyやdataを使った処理;
}*/
//int i = Integer.parseInt(s);
//Queue<String> qq=new ArrayDeque<>(); //add,poll,peek
//Deque<String> qq=new ArrayDeque<>();//push,pop,peek
//ArrayList<String> cc = new ArrayList<>(n);
//Collections.sort(list);
//Array.sort(list);
//Arrays.asList(c).contains("a")
//list.set(1,"walk");
public class Main {
	static int a1[]= {0,-1,0,1};
	static int b1[]= {-1,0,1,0};
	private static Scanner sc = new Scanner(System.in);
	static void p(String ans) {System.out.println(ans);};
	static void p(int ans) {System.out.println(ans);};
	static void p(long ans) {System.out.println(ans);};
	static void p(double ans) {System.out.println(ans);};
	static int K;
	public static void main(String[] args) {
		String H=sc.next();
		String W=sc.next();
		
		int N=Integer.parseInt(H+W);
		boolean a=false;
		for(int i=1;Math.pow(i, 2)<=N;i++) {
			if(Math.pow(i, 2)==N) {
				a=true;
			}
		}
		if(a) {
			p("Yes");
		}else {
			p("No");
		}
		//p((double)H*W/2);
		
	}
}
