# Task
 In the Land Of Chess, bishops don't really like each other. In fact, when two bishops happen to stand on the same diagonal, they immediately rush towards the opposite ends of that same diagonal.

 Given the initial positions (in chess notation) of two bishops, `bishop1` and `bishop2`, calculate their future positions. Keep in mind that bishops won't move unless they see each other along the same diagonal.

# Example

 For `bishop1 = "d7" and bishop2 = "f5"`, the output should be `["c8", "h3"]`.

 ![](https://codefightsuserpics.s3.amazonaws.com/tasks/bishopDiagonal/img/ex_1.jpg?_tm=1473766087137)

 For `bishop1 = "d8" and bishop2 = "b5"`, the output should be `["b5", "d8"]`.

 The bishops don't belong to the same diagonal, so they don't move.

 ![](https://codefightsuserpics.s3.amazonaws.com/tasks/bishopDiagonal/img/ex_2.jpg?_tm=1473766087425)

# Input/Output


 - `[input]` string `bishop1`

    Coordinates of the first bishop in chess notation.


 - `[input]` string `bishop2`

    Coordinates of the second bishop in the same notation.


 - `[output]` a string array

    Coordinates of the bishops in lexicographical order after they check the diagonals they stand on.

```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 = '# Convert chess notation to zero indexed tuple (x, y)\nint_pos = lambda s: (ord(s[0]) - ord("a"), int(s[1]) - 1)\n# Convert zero indexed tuple (x, y) to chess notation\nnote_pos = lambda t: "{}{}".format(chr(t[0] + ord("a")), t[1] + 1)\n\ndef bishop_extend(pos, move):\n    """\n    Extend a bishops attack position in the given move\n    direction, until a legal move is not possible\n    yielding each legal position in turn\n    """\n    x, y = pos\n    dx, dy = move\n    while 0 <= x + dx < 8 and 0 <= y + dy < 8:\n        x += dx\n        y += dy\n        yield (x, y)\n\ndef bishop_attack(pos):\n    """\n    Given a position, return a dict of all possible \n    attackable positions and the direction of movement\n    required to attack that position\n    """\n    result = {}\n    for dx, dy in [(x, y) for x in [-1, 1] for y in [-1, 1]]:\n        for attack_pos in bishop_extend(pos, (dx, dy)):\n            result[attack_pos] = (dx, dy)\n    return result\n\ndef bishop_diagonal(bishop1, bishop2):\n    """\n    Given two bishops on a chess board, if they are able to attack each other\n    move them as far apart as possible.\n    """\n    b1, b2 = int_pos(bishop1), int_pos(bishop2)\n    b1_attack, b2_attack = bishop_attack(b1), bishop_attack(b2)\n    if b1 in b2_attack:\n        # Attack paths intersect\n        b1d, b2d = b1_attack[b2], b2_attack[b1]\n        # move b1 in the direction b2 attacked and keep last legal move\n        bishop1 = note_pos(list(bishop_extend(b1, b1d))[-1])\n        # Same for b2\n        bishop2 = note_pos(list(bishop_extend(b2, b2d))[-1])\n    return sorted([bishop1, bishop2])\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'bishop_diagonal'
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: 10282