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 = 'class Solution:\n    def largestComponentSize(self, A: List[int]) -> int:\n        def pfactorization(a):\n            N = a\n            if a >= 2 and a % 2 == 0:   #treat 2 alone\n                Gp[2].append(N)\n                Gn[N].append(2)\n                while a % 2 == 0:\n                    a //= 2\n            for d in range(3, math.floor(a**(1/2)) + 1, 2): #possible odd numbers\n                if d > a:   break\n                if a % d == 0:\n                    Gn[N].append(d)\n                    Gp[d].append(N)\n                    while a % d == 0:\n                        a //= d\n            if a > 1:   #check if what remains is itself a prime\n                Gp[a].append(N)\n                Gn[N].append(a)\n        #Find the prime factors of the current number using Gn,\n        #For each prime factor, find all the numbers excluding self who have this prime factor\n        #They should all be connected\n        def dfs(curr):\n            if curr in seenNodes:\n                return 0\n            seenNodes.add(curr)\n            total = 1\n            for p in Gn[curr]:\n                if p in seenPrimes:\n                    continue\n                seenPrimes.add(p)\n                for owner in Gp[p]:\n                    total += dfs(owner)\n            return total\n        #This graph contains numbers in the list sharing the a prime factor, the key is that prime factor\n        Gp = defaultdict(list)\n        #This graph stores prime factors of each number in the list\n        Gn = defaultdict(list)\n        for a in A:\n            pfactorization(a)\n        seenPrimes, seenNodes = set(), set()\n        return max([dfs(a) for a in A])\n#Time Complexity : O(sqrt(max(A)*max(A))\n'
_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: 10106