The queen can be moved any number of unoccupied squares in a straight line vertically, horizontally, or diagonally, thus combining the moves of the rook and bishop. The queen captures by occupying the square on which an enemy piece sits. (wikipedia: https://en.wikipedia.org/wiki/Queen_(chess)).

## Task:
Write a function ```availableMoves(position)``` which returns possibly moves of chess queen. Returned value should be an ```array``` with possible moves sorted alphabetically, exluded starting position.

For example when input position is ```A1``` return value should be:

```["A2", "A3", "A4", "A5", "A6", "A7", "A8", "B1", "B2", "C1", "C3", "D1", "D4", "E1", "E5", "F1", "F6", "G1", "G7", "H1", "H8"]```

```
     A   B   C   D   E   F   G   H
   + - + - + - + - + - + - + - + - +
1  | Q | x | x | x | x | x | x | x |
   + - + - + - + - + - + - + - + - +
2  | x | x |   |   |   |   |   |   |
   + - + - + - + - + - + - + - + - +
3  | x |   | x |   |   |   |   |   |
   + - + - + - + - + - + - + - + - +
4  | x |   |   | x |   |   |   |   |
   + - + - + - + - + - + - + - + - +
5  | x |   |   |   | x |   |   |   |
   + - + - + - + - + - + - + - + - +
6  | x |   |   |   |   | x |   |   |
   + - + - + - + - + - + - + - + - +
7  | x |   |   |   |   |   | x |   |
   + - + - + - + - + - + - + - + - +
8  | x |   |   |   |   |   |   | x |
   + - + - + - + - + - + - + - + - +
   
Q = queen
x = available move
```

## Input:
- input position can be any type (array, number, string and so on). If input position is not a string then return empty array.
- valid input position is one letter from ```A``` to ```H``` with number from ```1``` to ```8```, for example ```A1```, ```C8```, ```B3```. If input is invalid (for example ```A10``` or ```H0```) then return empty array.

```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 Horizontal(position):\n    R = position[1];\n    HorizontalMoves = ["A"+R, "B"+R, "C"+R, "D"+R, "E"+R, "F"+R, "G"+R, "H"+R];\n    possible = list(filter(lambda x:(x!=position),HorizontalMoves));\n    return possible;\n\ndef Vertical(position):\n    F = position[0]; #Current file of the queen\'s position\n    VerticalMoves = [F+str(1), F+str(2), F+str(3), F+str(4), F+str(5), F+str(6), F+str(7), F+str(8)];\n    #VerticalMoves.remove(position);\n    p = list(filter(lambda y:(y!=position),VerticalMoves));\n    return p;\n\n\ndef TRtBL (position): #top being 8th rank and bottom being 1st rank R=>HFile, L=>A file\n    moves = []; #intialize an array for all moves in this diag\n    num = int(position[1]); #rank of the position (1-8)\n    ASC_Letter = ord(position[0]); #gives ascii value of the "File" of queen position\n    Up = num;\n    Down = num;\n    TempLetter = ASC_Letter;\n    TempLetter2 = ASC_Letter;\n    while TempLetter<72 and Up<8:\n        if position[0] == "H" or Up==8:\n            break;\n        TempLetter = TempLetter + 1;\n        Up = Up + 1;\n        moves.append(chr(TempLetter) + str(Up)); #stores coordinate to moves\n    while TempLetter2>65 and Down>0:\n        if position[0] == "A" or Down == 1:\n            break;\n        TempLetter2 = TempLetter2 - 1;\n        Down = Down - 1;\n        moves.append(chr(TempLetter2) + str(Down));\n    return moves;\n\ndef TLtBR (position):   #top being 8th rank and bottom being 1st rank R=>HFile, L=>A file\n    moves = []; #intialize an array for all moves in this diag\n    num = int(position[1]); #rank of the position (1-8)\n    ASC_Letter = ord(position[0]); #gives ascii value of the "File" of queen position\n    Up = num;\n    Down = num;\n    TempLetter = ASC_Letter;\n    TempLetter2 = ASC_Letter;\n    while TempLetter<72 and Down>1:\n        if position[0] == "H":\n            break;\n        TempLetter = TempLetter + 1;\n        Down = Down - 1;\n        moves.append(chr(TempLetter) + str(Down)); #stores coordinate to moves\n    while TempLetter2>65 and Up<8:\n        if position[0] == "A":\n                break;\n        TempLetter2 = TempLetter2 - 1;\n        Up = Up + 1;\n        moves.append(chr(TempLetter2) + str(Up));\n    return moves;\ndef available_moves(position):\n    answer = [];\n    if not position:\n        return answer;\n    if not isinstance(position,str):\n        return answer;\n    if len(position) != 2:\n        return answer;\n    if int(position[1]) < 1 or int(position[1]) > 8:\n        return answer;\n    if position[0].isdigit():\n        return answer;\n    if ord(position[0])>72:\n        return answer;\n    \'#now the function calls the 4 subfunctions(vertical,horizont,TLtBR,TRtBL)\'\n    \'# After all possible moves have been added a simple sorting function can be returned to \'\n    \'# give the final array in alphabetical order\'\n    answer.extend(Horizontal(position));\n    answer.extend(Vertical(position));\n    answer.extend(TLtBR(position));\n    answer.extend(TRtBL(position));\n    answer.sort();\n    return answer;'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'available_moves'
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: 5954