def circleOfNumbers(n, firstNumber):
    '''
    Consider integer numbers from 0 to n - 1 written down along the circle in such a way 
    that the distance between any two neighbouring numbers is equal 
    (note that 0 and n - 1 are neighbouring, too).
    
    Given n and firstNumber, find the number which is written in the 
    radially opposite position to firstNumber.
    '''
    mid = n // 2
    return (firstNumber + mid) % n

print(circleOfNumbers(10, 2))
def circleOfNumbers(n, firstNumber):
    '''
    Consider integer numbers from 0 to n - 1 written down along the circle in such a way 
    that the distance between any two neighbouring numbers is equal 
    (note that 0 and n - 1 are neighbouring, too).
    
    Given n and firstNumber, find the number which is written in the 
    radially opposite position to firstNumber.
    '''
    mid = n // 2
    return (firstNumber + mid) % n

print(circleOfNumbers(10, 2))
Consider integer numbers from 0 to n - 1 written down along the circle in such a way      that the distance between any two neighbouring numbers is equal      (note that 0 and n - 1 are neighbouring, too).          Given n and firstNumber, find the number which is written in the      radially opposite position to firstNumber.