```python
def find_longest_repeating_subseq(str):
    n = len(str)
    
    # dp[i][j] will store the length of the Longest Repeating Subsequence
    # of the prefixes str[0...i-1] and str[0...j-1]
    dp = [[0] * (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 the characters match and their indices are different
            if str[i - 1] == str[j - 1] and i != j:
                # We can extend the LRS by one character
                dp[i][j] = 1 + dp[i - 1][j - 1]
            else:
                # Otherwise, we take the maximum length from the two possible
                # subproblems: excluding the character at i-1 or excluding
                # the character at j-1.
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
                
    # The value at dp[n][n] contains the length of the LRS for the entire string
    return dp[n][n]
```