Given a non-empty array of unique positive integers A, consider the following graph:

There are A.length nodes, labelled A[0] to A[A.length - 1];
There is an edge between A[i] and A[j] if and only if A[i] and A[j] share a common factor greater than 1.

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



Example 1:
Input: [4,6,15,35]
Output: 4



Example 2:
Input: [20,50,9,63]
Output: 2



Example 3:
Input: [2,3,6,7,4,12,21,39]
Output: 8


Note:

1 <= A.length <= 20000
1 <= A[i] <= 100000

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "# Build the graph by checking if every pair of nodes has a common factor greater than one, and if\n# it does, connect them together (Create an edge between them). The only issue with this is that it\n# runs in N^2 time.\n#\n# Then, we use dfs to find the largest connected component?\n#\n# Using dfs to find the largest connected component is okay, as it runs in N time, the problem is\n# finding every edge for every pair of numbers in A takes too long (N^2 time).\n#\n# We can't use dfs as there are too many pairs to make. What needs to be done instead is to use\n# union find to group nodes by factors.\n\nclass DSU:\n    \n    def __init__(self):\n        self.parent = defaultdict(lambda: -1)\n        \n    def union(self, x: int, y: int):\n        xSet = self.find(x)\n        ySet = self.find(y)\n        self.parent[xSet] = ySet\n        \n    def find(self, x: int):\n        if x not in self.parent:\n            self.parent[x] = x\n        if x != self.parent[x]:\n            self.parent[x] = self.find(self.parent[x])\n        return self.parent[x]\n        \n        \nclass Solution:\n    \n    def largestComponentSize(self, A: List[int]) -> int:\n        counts = Counter()\n        dsu = DSU()\n        for node in A:\n            k = 2\n            factors = []\n            while k * k <= node:\n                if node % k == 0:\n                    factors.append(k)\n                    while node % k == 0:\n                        node //= k\n                        \n                k += 1\n            \n            if node > 1:\n                factors.append(node)\n            \n            for x, y in zip(factors, factors[1:]):\n                dsu.union(x, y)\n            \n            if factors:\n                counts[factors[0]] += 1\n                \n        finalCounts = Counter()\n            \n        for key in counts.keys():\n            finalCounts[dsu.find(key)] += counts[key]\n\n        return max(finalCounts.values())"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'largestComponentSize'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 9396