Given an array of integers A with even length, return true if and only if it is possible to reorder it such that A[2 * i + 1] = 2 * A[2 * i] for every 0 <= i < len(A) / 2.








 
Example 1:
Input: A = [3,1,3,6]
Output: false

Example 2:
Input: A = [2,1,2,6]
Output: false

Example 3:
Input: A = [4,-2,2,-4]
Output: true
Explanation: We can take two groups, [-2,-4] and [2,4] to form [-2,-4,2,4] or [2,4,-2,-4].

Example 4:
Input: A = [1,2,4,16,8,4]
Output: false

 
Constraints:

0 <= A.length <= 3 * 104
A.length is even.
-105 <= A[i] <= 105

```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 canReorderDoubled(self, A: List[int]) -> bool:\n        # Array of Doubled Pairs 9/24 8/31/20\n        # 1:43 9/1/2020\n#         c = collections.Counter(A)\n#         for x in sorted(c, key=abs):\n#             if c[x] > c[x * 2]:\n#                 return False\n#             c[x*2] -= c[x]\n        \n#         return True\n        \n\n    \n        A = [abs(num) for num in A ]\n        A.sort()\n        dic = collections.defaultdict(collections.deque)\n        for i, num in enumerate(A):\n            dic[num].append(i)\n        \n        visited = [0]*len(A)\n        cnt = 0\n        i = 0\n        # while cnt < len(A) // 2 :\n        while i < len(A):\n            if visited[i]:\n                i += 1\n                continue\n            val, val_double = A[i], 2 * A[i]\n            if val_double in dic and dic[val_double]:\n                if val not in dic or not dic[val]:\n                    return False\n                dic[val].popleft()\n                if not dic[val_double]:\n                    return False\n                index = dic[val_double].popleft()\n                visited[index] = 1\n                \n            else:\n                return False\n            i += 1\n            # cnt += 1\n            \n        return True\n    \n#         A = [abs(num) for num in A ]\n#         A.sort()\n#         dic = collections.defaultdict(int)\n#         for num in A:\n#             dic[num] += 1\n        \n#         visited = [0]*len(A)\n#         cnt = 0\n#         i = 0\n#         while cnt < len(A) // 2 :\n#             if visited[i]:\n#                 i += 1\n#                 continue\n#             val_small = A[i]\n#             if 2*val_small in dic:\n#                 dic[2*val_small] -= 1\n#                 dic[val_small] -= 1\n#                 if dic[2*val_small] < 0 or dic[val_small] < 0:\n#                     return False\n#                 search_index = A.index(2*val_small, i+1)\n#                 while visited[search_index]:\n#                     search_index = A.index(2*val_small, search_index+1)\n#                 visited[search_index] = 1\n#             else:\n#                 return False\n#             i += 1\n#             cnt += 1\n            \n#         return True\n                \n\n            \n        \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'canReorderDoubled'
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: 8340