def find_Rotations(str):
     
    tmp = str + str
    n = len(str) 
    for i in range(1,n + 1): 
        substring = tmp[i: i+n] 
        if (str == substring): 
            return i 
    return n 
def find_Rotations(str):
    tmp = str + str
    n = len(str)
    i = 1
    while i < n + 1:
       
        substring = tmp[i : i + n]
        if str == substring:
            return i
        i += 1
    return n