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 \n\n    def longestArithSeqLength(self, A: List[int]) -> int:\n        n = len(A)\n        dp = [{} for i in range(n)]\n        result = 2\n        \n        for i in range(1, n):\n            for j in range(i):\n                delta = A[i] - A[j]\n                \n                # If we've seen this delta with dp[j], then increase the length of the subseq by 1.\n                # This is equivalent of dp[i] 'adding on' to the subsequence.\n                if delta in dp[j]:\n                    currentLength = dp[j].get(delta)\n                    dp[i][delta] = currentLength + 1\n                \n                else:\n                    dp[i][delta] = 2\n                \n                result = max(result, dp[i][delta])        \n        return result\n    \n    def longestArithSeqLength2(self, A: List[int]) -> int:\n        from collections import Counter\n        cnt = Counter()\n        cnt\n        arith = [Counter() for i in range(len(A))]\n        longest = 0\n        for i in range(len(A)-2, -1,-1):\n            for j in range(i+1, len(A)):\n                diff = A[j]-A[i]\n                arith[i][diff] = max(1 + arith[j][diff], arith[i][diff])\n                longest = max(longest, arith[i][diff])\n        #print(arith)\n        \n        #         for i in range(len(A)):\n        #             #print(arith[i])\n        #             most_common = arith[i].most_common()\n\n        #             longest = max(most_common[0][1] if most_common else 0, longest)\n        return longest + 1\n        # for i in range(len(A)):\n        #     for j in range(i+1, len(A)):\n        #         cnt[A[j]-A[i]] += 1\n        #     print(A[i], cnt)\n        # print(cnt)\n        # val = cnt.most_common()[0][1]\n        # return val + 1 \n            \n        \n        #         self.arith = [dict() for i in range(len(A))]\n\n        #         def helper(i, diff):\n        #             if diff in self.arith[i]:\n        #                 return self.arith[i][diff]\n\n        #             val = 0\n        #             for j in range(i+1, len(A)):\n        #                 if A[j] - A[i] == diff:\n        #                     val = 1 + helper(j, diff)\n        #                     break\n        #             self.arith[i][diff] = val        \n        #             return self.arith[i][diff]\n        \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: 6082