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 = 'import collections\nclass DisjointSet:\n    def __init__(self):\n        self.size={}\n        self.parent={}\n    \n    def makeSet(self,val):\n        self.parent[val]=val\n        self.size[val]=1\n    \n    def find(self,val):\n        if self.parent[val]==val:\n            return val\n        self.parent[val]=self.find(self.parent[val])\n        return self.parent[val]\n    \n    def union(self,x,y):\n        x=self.find(x)\n        y=self.find(y)\n        if x==y:\n            return self.size[x]\n        if self.size[x]<self.size[y]:\n            x,y=y,x\n        \n        self.parent[y]=x\n        self.size[x]+=self.size[y]\n        return self.size[x]\n        \nclass Solution:\n    def largestComponentSize(self, A: List[int]) -> int:\n        A.sort()\n        disjointSet=DisjointSet()\n        for val in A:\n            disjointSet.makeSet(val)\n        factors=collections.defaultdict(set)\n        ans=0\n        # print(disjointSet.size,disjointSet.parent)\n        for val in A:\n            for i in range(1,int(val**0.5)+1):\n                if i==1:\n                    # if val in factors:\n                    #     ans=max(ans,disjointSet.union(factors[val],val))\n                    # factors[val]=val\n                    factors[val].add(val)\n                    continue\n                if val%i!=0:\n                    continue\n                factors[i].add(val)\n                factors[val//i].add(val)\n                # if i in factors:\n                #     res=disjointSet.union(factors[i],val)\n                #     # print(res,factors[i],val)\n                #     ans=max(ans,res)\n                # factors[i]=val\n                # tmp=val//i\n                # if tmp in factors:\n                #     res=disjointSet.union(factors[tmp],val)\n                #     # print(res,factors[tmp],val)\n                #     ans=max(ans,res)\n                # factors[tmp]=val\n        # print(factors,disjointSet.parent,disjointSet.size)\n        for _,itms in list(factors.items()):\n            items=list(itms)\n            i=1\n            while i <len(items):\n                ans=max(ans,disjointSet.union(items[i-1],items[i]))\n                i+=1\n                \n        \n        return ans\n                        \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: 10424