Given a positive number n > 1 find the prime factor decomposition of n.
The result will be a string with the following form :
```
 "(p1**n1)(p2**n2)...(pk**nk)"
```
where ```a ** b``` means ```a``` to the power of ```b```

with the p(i) in increasing order and n(i) empty if
n(i) is 1.
```
Example: n = 86240 should return "(2**5)(5)(7**2)(11)"
```

```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 = '# Using the sqrt function for speed (instead of **0.5)\nfrom math import sqrt\ndef seiveOfEratosthenes(n):\n    # For speed, only grabbing all odd numbers from 3 to SQRT N\n    flags = [True for i in range(3, int(sqrt(n))+1, 2)]\n    # Adding a flag for "2" (effectively a pre-pend here)\n    flags.append(True)\n    \n    # Iterate through Primes\n    prime = 2\n    while (prime <= sqrt(n)):\n        # Cross Off all multiples of Prime\n        for i in range(prime**2, len(flags), prime):\n            flags[i] = False\n        \n        # Get next Prime\n        prime += 1\n        while (prime < len(flags) and not flags[prime]):\n            prime += 1\n    # Get the list of Primes as actual #\'s; We need a special case for "2" because it doesn\'t fit the odds pattern\n    if flags[0]:\n        primes = [2]\n    else:\n        primes = []\n    primes += [i for i in range(3, len(flags), 2) if flags[i]]\n    \n    return primes\n        \n    \n\ndef primeFactors(n):\n    # Get applicable Prime numbers\n    primes = seiveOfEratosthenes(n)\n    primes_in_number = []\n    \n    for prime in primes:\n        # Iterate through each prime, and figure out how many times it goes in\n        repeat = 0\n        while (not (n % prime)):\n            repeat += 1\n            n /= prime\n        \n        # Add appearing Primes appropriately\n        if repeat == 1:\n            primes_in_number.append("(" + str(prime) + ")")\n        elif repeat:\n            primes_in_number.append("(" + str(prime) + "**" + str(repeat) + ")")\n    \n    # Only testing primes up to sqrt of n, so we need to add n if it hasn\'t been reduced to 1\n    if n > 1:\n        primes_in_number.append("(" + str(int(n)) + ")")\n    \n    return \'\'.join(primes_in_number)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'primeFactors'
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: 26558