def longest_subseq_with_diff_one(arr, n):
    if n == 0:
        return 0

    dp = [1] * n
    best = 1

    for i in range(n):
        for j in range(i):
            if abs(arr[i] - arr[j]) == 1:
                dp[i] = max(dp[i], dp[j] + 1)
        if dp[i] > best:
            best = dp[i]

    return best