# Task

You are a lonely frog. 

You live on an integer array.

The meaning of your life is to jump and jump..

Now, here comes your new task. 

You are given an integer array `arr` and a positive integer `n`.

You will jump following the rules below:

- Your initial position at `arr[0]`. arr[0] will always be `0`.

- You will jump according to the number of current position(arr[i])
  - That is, if the number is a positive integer, let say 3, you will jump forward 3 steps; If the number is a negative integer, let say -3, you will jump backward 3 steps; If the number is 0, you will stay here for a little rest.

- The number of current position(arr[i]) will increase decrease by 1 after each turn (jump or stay).
  - That is, if the number of current position(arr[i]) is greater than or equal to `n`, the number will decrease 1; if the number at current position(arr[i]) is less than `n`, the number will increase 1.

You will stop jumping when you reach the exit (your position greater than or equal to arr.length). Please tell me, at the moment, how many elements in `arr` are equal to `n`?

# Note

- `3 <= arr.length <= 1000`, `1 <= n <= 9`

- Frog will never jump backward out of `arr`.

# Example

For `arr = [0,3,0,1,-3], n = 3`, the output should be `2`.
```
 Let us jump softly:
 
 [0,3,0,1,-3]
  ^--You are here, current number is 0, you stay here. 
     currect number 0 < n, so 0 -> 1
 [1,3,0,1,-3]
  ^--You are here, current number is 1, you will jump forward 
     to position 1. current number 1 < n, so 1 -> 2
 [2,3,0,1,-3]
    ^--You are here, current number is 3, you will jump forward 
       to position 4. current number 3 >= n, so 3 -> 2
 [2,2,0,1,-3]
           ^--You are here, current number is -3, you will jump backward
              to position 1. current number -3 < n, so -3 -> -2
 [2,2,0,1,-2]
    ^--You are here, current number is 2, you will jump forward 
       to position 3. current number 2 < n, so 2 -> 3
 [2,3,0,1,-2]
        ^--You are here, current number is 1, you will jump forward
           to position 3. current number 1 < n, so 1 -> 2
 [2,3,0,2,-2]
           ^--You are here, current number is -2, you will jump backward
              to position 2. current number -2 < n, so -2 -> -1
 [2,3,0,2,-1]
      ^--You are here, current number is 0, you stay here.
         current number 0 < n, so 0 -> 1
 [2,3,1,2,-1]
      ^--You are here, current number is 1, you will jump forward 
         to position 3. current number 1 < n, so 1 -> 2
 [2,3,2,2,-1]
        ^--You are here, current number is 2, you will jump forward to position 5.
     current number 2 < n, so 2 -> 3
 [2,3,2,3,-1] exit
               ^--You are here, you reach to the exit.
 
 At the moment, arr[1] and arr[3] are equal to n.
 So, the output should be 2.
```
For `arr = [0,-1,-2,-3,-4], n = 4`, the output should be `2`.
```
 Let's us jump fast ;-)
 
 [0,-1,-2,-3,-4]
  ^
 [1,-1,-2,-3,-4]
  ^
 [2,-1,-2,-3,-4]
     ^
 [2, 0,-2,-3,-4]
  ^
 [3, 0,-2,-3,-4]
        ^
 [3, 0,-1,-3,-4]
  ^
 [4, 0,-1,-3,-4]
           ^
 [4, 0,-1,-2,-4]
  ^
 [3, 0,-1,-2,-4]
              ^
 [3, 0,-1,-2,-3]
  ^
 [4, 0,-1,-2,-3]
           ^
 [4, 0,-1,-1,-3]
     ^
 [4, 1,-1,-1,-3]
     ^
 [4, 2,-1,-1,-3]
        ^
 [4, 2, 0,-1,-3]
     ^
 [4, 3, 0,-1,-3]
           ^
 [4, 3, 0, 0,-3]
        ^
 [4, 3, 1, 0,-3]
        ^
 [4, 3, 2, 0,-3]
           ^
 [4, 3, 2, 1,-3]
           ^
 [4, 3, 2, 2,-3]
              ^
 [4, 3, 2, 2,-2]
     ^
 [4, 4, 2, 2,-2]
              ^
 [4, 4, 2, 2,-1]
        ^
 [4, 4, 3, 2,-1]
              ^
 [4, 4, 3, 2, 0]
           ^
 [4, 4, 3, 3, 0] exit
                 ^
 At the moment, arr[0] and arr[1] are equal to n.
 So, the output should be 2.
```

For `arr = [0,-1,-2,-3,-4], n = 3`, the output should be `0`.
```
 Let's jump fast ;-)
 
 [0,-1,-2,-3,-4]
  ^
 [1,-1,-2,-3,-4]
  ^
 [2,-1,-2,-3,-4]
     ^
 [2, 0,-2,-3,-4]
  ^
 [3, 0,-2,-3,-4]
        ^
 [3, 0,-1,-3,-4]
  ^
 [2, 0,-1,-3,-4]
           ^
 [2, 0,-1,-2,-4]
  ^
 [3, 0,-1,-2,-4]
        ^
 [3, 0, 0,-2,-4]
     ^
 [3, 1, 0,-2,-4]
     ^
 [3, 2, 0,-2,-4]
        ^
 [3, 2, 1,-2,-4]
        ^
 [3, 2, 2,-2,-4]
           ^
 [3, 2, 2,-1,-4]
     ^
 [3, 3, 2,-1,-4]
           ^
 [3, 3, 2, 0,-4]
        ^
 [3, 3, 3, 0,-4]
              ^
 [3, 3, 3, 0,-3]
  ^
 [2, 3, 3, 0,-3]
           ^
 [2, 3, 3, 1,-3]
           ^
 [2, 3, 3, 2,-3]
              ^
 [2, 3, 3, 2,-2]
     ^
 [2, 2, 3, 2,-2]
              ^
 [2, 2, 3, 2,-1]
        ^
 [2, 2, 2, 2,-1] exit
                  ^
 
 At the moment, there is no element equal to n.
 So, the output should be 0.
```

[Base idea taken from [here](https://adventofcode.com/2017/day/5)]

```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 jumping(arr, n):\n    ind = 0\n    add = 0\n    while ind < len(arr):\n        if arr[ind] >= n:\n            add = -1\n        else:\n            add = 1\n        arr[ind] += add\n        ind += arr[ind] - add\n    return arr.count(n)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'jumping'
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: 5482