# Task
 Pac-Man got lucky today! Due to minor performance issue all his enemies have frozen. Too bad Pac-Man is not brave enough to face them right now, so he doesn't want any enemy to see him. 
 
 Given a gamefield of size `N` x `N`, Pac-Man's position(`PM`) and his enemies' positions(`enemies`), your task is to count the number of coins he can collect without being seen.

 An enemy can see a Pac-Man if they are standing on the same row or column. 
 
 It is guaranteed that no enemy can see Pac-Man on the starting position. There is a coin on each empty square (i.e. where there is no Pac-Man or enemy).

# Example

 For `N = 4, PM = [3, 0], enemies = [[1, 2]]`, the result should be `3`.
```
Let O represent coins, P - Pac-Man and E - enemy.
OOOO
OOEO
OOOO
POOO```
Pac-Man cannot cross row 1 and column 2. 

 He can only collect coins from points `(2, 0), (2, 1) and (3, 1)`, like this:
 ```
x is the points that Pac-Man can collect the coins.
OOOO
OOEO
xxOO
PxOO
 ```

# Input/Output


 - `[input]` integer `N`

  The field size.


 - `[input]` integer array `PM`

  Pac-Man's position (pair of integers)


 - `[input]` 2D integer array `enemies`

  Enemies' positions (array of pairs)


 - `[output]` an integer

  Number of coins Pac-Man can collect.
  
  
# More PacMan Katas

 - [Play PacMan: Devour all](https://www.codewars.com/kata/575c29d5fcee86cb8b000136)

 - [Play PacMan 2: The way home](https://www.codewars.com/kata/575ed46e23891f67d90000d8)

```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 = 'import numpy as np\n\n\ndef count(gamefield, PM , N):\n    gamefield[PM[0], PM[1]] = -1\n    case1 = 0\n    case2 = 0\n    case3 = 0\n    case4 = 0\n#recursive case    \n    if (PM[0] + 1) < N and gamefield[PM[0] + 1, PM[1]] != -1:  \n        case1 = 1 + count(gamefield, [PM[0]+1, PM[1]], N)\n    if (PM[0] - 1) > -1 and gamefield[PM[0] - 1, PM[1]] != -1:\n        case2 =  1 + count(gamefield, [PM[0]-1, PM[1]], N)\n    if (PM[1] + 1) < N and gamefield[PM[0], PM[1] + 1] != -1:\n        case3 = 1 + count(gamefield, [PM[0], PM[1] + 1], N)\n    if (PM[1] - 1) > -1 and gamefield[PM[0], PM[1] - 1] != -1:\n        case4 = 1 + count(gamefield, [PM[0], PM[1] - 1], N)\n    \n    return (case1 + case2 + case3 + case4)\n\n\n\n\n\ndef pac_man(N, PM, enemies):\n  #coding and coding..\n    #base case 1\n    if N == 1:\n        return 0\n    #base case 2\n    if len(enemies) == 0:\n        return (N**2) - 1\n    \n    gamefield = np.ones((N,N))\n    gamefield[PM[0], PM[1]] = 7#PM\n    \n\n    for e in enemies:\n        gamefield[:, e[1]] = -1#enemy\n        gamefield[e[0], :] = -1#enemy\n    print(gamefield)\n    \n  \n    return count(gamefield, PM, N)\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'pac_man'
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: 5612