Extracted text: Answer in C++ Only The Company has announced for his staff to have a free Ride service. The City of Jamshedpur has a different structure - all of its N rides are arranged in a circle, counting from 1 to N in a clockwise direction. The Company restaurant is located at Rider number 1. There is a single ring road that runs over the perimeter of this circle and connects all the rides. There are also N - 1 different travel agencies available in Bhiwani. For all the different ride points A and B there is a single connector that connects these points and belongs to the Kth shuttle agency where the K distance between A and B is clockwise, that is, there are K-1 boarding points between points A and B according to by clock. Name the shuttle as (A, B). So if N = 4, the first agency has shuttles (1,2), (2,3), (3,4), (4,1), the second agency has shuttles (1,3)), (2,4) and third-party shuttles are (1,4), (2,1), (3,2), (4,3). If the shuttle connects points A and B, it is possible to move from A to B and from B to A using this shuttle. Company plans to make a contract with one of the agencies so that all his employees can travel freely to that agency for free. So, he wants to choose such a agency so that people from any boarding area can access his restaurant using only the shutters of the selected agency and perhaps using certain intermediate rides. Your job is to find out how many shuttle agencies there are. Inputs: 1 2 Output: 1