#!/usr/bin/env python3
"""Auto-generated by AGI Loop cycle #1267
Task: ,</think>

Write a Python function that calculates the number of distinct cyclic permutations of a given string, considering rotations that result in the same sequence as identical.
Generated: 2026-02-13T02:23:27.877829
"""

def count_distinct_cyclic_permutations(s):
    seen = set()
    n = len(s)
    for i in range(n):
        rotated = s[i:] + s[:i]
        seen.add(rotated)
    return len(seen)

if __name__ == '__main__':
    test_string = "abc"
    result = count_distinct_cyclic_permutations(test_string)
    print(f"Number of distinct cyclic permutations of '{test_string}': {result}")