Remember the game 2048?

The main part of this game is merging identical tiles in a row. 

* Implement a function that models the process of merging all of the tile values in a single row.  
* This function takes the array line as a parameter and returns a new array with the tile values from line slid towards the front of the array (index 0) and merged.
* A given tile can only merge once.
* Empty grid squares are represented as zeros.
* Your function should work on arrays containing arbitrary number of elements.


## Examples

```
merge([2,0,2,2])  -->  [4,2,0,0]
```

Another example with repeated merges: 

```
merge([4,4,8,16])  -->  [8,8,16,0]
merge([8,8,16,0])  -->  [16,16,0,0]
merge([16,16,0,0]) -->  [32,0,0,0]
```

```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 = '# Dumb 4-size array solution cause why not?\ndef merge(line):\n    if line[0] != 0 and line[0] == line[1]:\n        if line[2] != 0 and line[2] == line[3]:\n            return [line[0] + line[1], line[2] + line[3], 0, 0]\n        else:\n            return [line[0] + line[1], line[2], line[3], 0]\n    elif line[0] != 0 and line[1] == 0 and line[0] == line[2]:\n        return [line[0] + line[2], line[3], 0, 0]\n    elif line[0] != 0 and line[1] == 0 and line[2] == 0 and line[0] == line[3]:\n        return [line[0] + line[3], 0, 0, 0]\n    elif line[0] != 0:\n        if line[1] != 0 and line[1] == line[2]:\n            return [line[0], line[1] + line[2], line[3], 0]\n        elif line[1] != 0 and line[2] == 0 and line[1] == line[3]:\n            return [line[0], line[1] + line[3], 0, 0]\n        elif line[1] != 0:\n            if line[2] != 0 and line[2] == line[3]:\n                return [line[0], line[1], line[2] + line[3], 0]\n            else:\n                return [line[0], line[1], line[2], line[3]]\n        else:\n            if line[2] != 0 and line[2] == line[3]:\n                return [line[0], line[2] + line[3], 0, 0]\n            else:\n                return [line[0], line[2], line[3], 0]\n    else:\n        if line[1] != 0 and line[1] == line[2]:\n            return [line[1] + line[2], line[3], 0, 0]\n        elif line[1] != 0 and line[2] == 0 and line[1] == line[3]:\n            return [line[1] + line[3], 0, 0, 0]\n        elif line[1] != 0:\n            if line[2] != 0 and line[2] == line[3]:\n                return [line[1], line[2] + line[3], 0, 0]\n            else:\n                return [line[1], line[2], line[3], 0]\n        else:\n            if line[2] != 0 and line[2] == line[3]:\n                return [line[2] + line[3], 0, 0, 0]\n            else:\n                return [line[2], line[3], 0, 0]\n\ndef merge(line):\n    i, res = 0, []\n    while i < len(line):\n        x = line[i]\n        if x:\n            for j,y in enumerate(line[i+1:], 1):\n                if y:\n                    if x == y:\n                        res.append(x + y)\n                        i += j\n                    else:\n                        res.append(x)\n                    break\n            else:\n                res.append(x)\n        i += 1\n    return res + [0]*(len(line) - len(res))'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'merge'
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: 5826