Given an array A of integers, return the length of the longest arithmetic subsequence in A.
Recall that a subsequence of A is a list A[i_1], A[i_2], ..., A[i_k] with 0 <= i_1 < i_2 < ... < i_k <= A.length - 1, and that a sequence B is arithmetic if B[i+1] - B[i] are all the same value (for 0 <= i < B.length - 1).
 
Example 1:
Input: A = [3,6,9,12]
Output: 4
Explanation: 
The whole array is an arithmetic sequence with steps of length = 3.

Example 2:
Input: A = [9,4,7,2,10]
Output: 3
Explanation: 
The longest arithmetic subsequence is [4,7,10].

Example 3:
Input: A = [20,1,15,3,10,5,8]
Output: 4
Explanation: 
The longest arithmetic subsequence is [20,15,10,5].

 
Constraints:

2 <= A.length <= 1000
0 <= A[i] <= 500

```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 longestArithSeqLength(self, A):\n        dp = dict()\n        for endi, endv in enumerate(A[1:], start = 1):\n            for starti, startv in enumerate(A[:endi]):\n                diff = endv - startv\n                if (starti, diff) in dp:\n                    dp[(endi, diff)] = dp[(starti, diff)] + 1\n                else:\n                    dp[(endi, diff)] = 2\n        return max(dp.values())\n    \nclass Solution:\n    def longestArithSeqLength(self, A):\n        dp = dict()\n        for starti, startv in enumerate(A):\n            for endi, endv in enumerate(A[starti+1:], start = starti+1):\n                diff = endv - startv\n                if (starti, diff) in dp:\n                    dp[(endi, diff)] = dp[(starti, diff)] + 1\n                else:\n                    dp[(endi, diff)] = 2\n        return max(dp.values())\n    \nclass Solution:\n    def longestArithSeqLength(self, A):\n        N = len(A)\n        dp = [{0:1} for _ in range(N)]\n        for end in range(1, N):\n            for start in range(end):\n                diff = A[end] - A[start]\n                if diff in dp[start]:\n                    dp[end][diff] = dp[start][diff] + 1\n                else:\n                    dp[end][diff] = 2\n        return max(max(dp[end].values()) for end in range(1, N))\n    \nclass Solution:\n    def longestArithSeqLength(self, A):\n        ans = 2\n        n = len(A)\n        index = {}\n        dp = [[2] * n for i in range(n)]\n        \n        for i, val in enumerate(A[:-1]):\n            for j in range(i+1, n):\n                first = val + val - A[j]\n                if first in index:\n                    dp[i][j] = dp[index[first]][i] + 1\n                    #ans = max(ans, dp[i][j])\n                    if dp[i][j] > ans: ans = dp[i][j]\n            index[val] = i\n        return ans\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'longestArithSeqLength'
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: 6120