Given a tree with nodes numbered to and edges, rooted at node . Find the number of unordered pair of distinct vertices such that there exists exactly one prime number on the simple path between vertex and .
Note:
Input format
Output format
Print a single integer, denoting the number of such pairs .
Constraints
There are such possible paths: