def find_longest_repeating_subseq(str):
    n = len(str)
    dp = [[0] * (n + 1) for _ in range(n + 1)]
    for i in range(1, n + 1):
        ci = str[i - 1]
        for j in range(1, n + 1):
            if ci == str[j - 1] and i != j:
                dp[i][j] = 1 + dp[i - 1][j - 1]
            else:
                a = dp[i - 1][j]
                b = dp[i][j - 1]
                dp[i][j] = a if a >= b else b
    return dp[n][n]