Largest Component Size by Common Factor

You are given an integer array of unique positive integers nums. Consider the following graph:

There are nums.length nodes, labeled nums[0] to nums[nums.length - 1].
There is an undirected edge between nums[i] and nums[j] if nums[i] and nums[j] share a common factor greater than 1.

Return the size of the largest connected component in the graph.

Example 1

Inputnums = [4,6,15,35]

Output4

All four numbers are connected through common factors, so the largest connected component has size 4.

Example 2

Inputnums = [20,50,9,63]

Output2

The largest connected components are [20,50] and [9,63], each of size 2.

Constraints