def max_len_sub(arr, n):
    # dp[i] stores the length of longest subsequence ending at index i
    # where adjacent elements differ by 1
    dp = [1] * n
    
    for i in range(1, n):
        for j in range(i):
            if abs(arr[i] - arr[j]) == 1:
                if dp[j] + 1 > dp[i]:
                    dp[i] = dp[j] + 1
    
    return max(dp)