The aim of the kata is to decompose `n!` (factorial n) into its prime factors.

Examples:
```
n = 12; decomp(12) -> "2^10 * 3^5 * 5^2 * 7 * 11"
since 12! is divisible by 2 ten times, by 3 five times, by 5 two times and by 7 and 11 only once.

n = 22; decomp(22) -> "2^19 * 3^9 * 5^4 * 7^3 * 11^2 * 13 * 17 * 19"

n = 25; decomp(25) -> 2^22 * 3^10 * 5^6 * 7^3 * 11^2 * 13 * 17 * 19 * 23
```

Prime numbers should be in increasing order. When the exponent of a prime is 1 don't put the exponent.

Notes

- the function is `decomp(n)` and should return the decomposition of `n!` into its prime factors in increasing order of the primes, as a string.
- factorial can be a very big number (`4000! has 12674 digits`, n will go from 300 to 4000).
- In Fortran - as in any other language - the returned string is not permitted to contain any redundant trailing whitespace: you can use `dynamically allocated character strings`.

```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 = "def decomp(chisl):\n    \n    div = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,\n        163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,\n        331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,\n        503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,\n        691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,\n        887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,\n        1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,\n        1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,\n        1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,\n        1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,\n        1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,\n        1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,\n        1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,\n        1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,\n        1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,\n        1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,\n        1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,\n    2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,\n    2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,\n    2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,\n    2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,\n    2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,\n    2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,\n    2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,\n    2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,\n    2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,\n    2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,\n    3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,\n    3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,\n    3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,\n    3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,\n    3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,\n    3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,\n    3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,\n    3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,\n    3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,\n    3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001]\n    exp = [0] * len(div)           \n    otvet = []  \n    chislo = 1\n    for i in range (1, chisl+1): \n        for ii in range(len(div)):\n            while i % div[ii] == 0:\n                i /= div[ii]\n                exp[ii] += 1\n    for ii in range(len(div)):            \n        if exp[ii] > 1:\n            otvet += [str(div[ii]) + '^' + str(exp[ii])]\n        if exp[ii] == 1:\n            otvet += [str(div[ii])]\n    return(' * '.join(otvet))\n    #your code here\n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'decomp'
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: 14762