```python
def find_longest_repeating_subseq(str):
    n = len(str)

    # dp[i][j] will store the length of the longest repeating subsequence
    # considering prefixes str[0...i-1] and str[0...j-1].
    dp = [[0 for _ in range(n + 1)] for _ in range(n + 1)]

    # Fill the dp table in a bottom-up manner.
    for i in range(1, n + 1):
        for j in range(1, n + 1):
            # If characters match and their original indices are different.
            if str[i - 1] == str[j - 1] and i != j:
                dp[i][j] = 1 + dp[i - 1][j - 1]
            # Otherwise, take the maximum from the previous subproblems.
            else:
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])

    return dp[n][n]

```