import
java.util.*;
class
GFG
{
static
boolean
isPerfectSquare(
int
[] arr,
int
n)
{
HashMap<Integer, Integer> umap =
new
HashMap<>();
for
(
int
i =
0
; i < n; i++)
{
if
(umap.containsKey(arr[i]))
umap.put(arr[i], umap.get(arr[i]) +
1
);
else
umap.put(arr[i],
1
);
}
Iterator<Map.Entry<Integer, Integer> >
iterator = umap.entrySet().iterator();
while
(iterator.hasNext())
{
Map.Entry<Integer, Integer> entry = iterator.next();
if
(entry.getValue() %
2
==
1
)
return
false
;
}
return
true
;
}
public
static
void
main (String[] args)
{
int
arr [] = {
2
,
2
,
7
,
7
};
int
n = arr.length;
if
(isPerfectSquare(arr, n))
System.out.println(
"Yes"
);
else
System.out.println(
"No"
);
}
}