A base station controller (BSC) is a device that controls a group of base stations in a cellular network. Which of the following is not a function of a BSC?1.0 MarksHandling signaling between mobile stations and the mobile switching center (MSC)Managing the radio resources of the base stations Routing data traffic between mobile stations and the internetProviding location information for mobile stationsControlling the handover of mobile stations between base stations

The BSC uses a technique called handover to transfer a mobile station from one base station to another as it moves. Which of the following is not a factor that the BSC considers when performing a handover?0.5 MarksThe distance between the mobile station and the base stationsThe signal strength of the base stationsThe quality of service requirements of the mobile stationThe location of the mobile stationThe available radio resources of the base stations

The BSC uses a technique called load balancing to distribute the traffic load evenly across the base stations in its control. Which of the following is not a method used by the BSC to implement load balancing?1.0 MarksDynamically adjusting the transmit power of the base stationsSwitching mobile stations between different frequency bands Using different modulation schemes for different base stationsScheduling the transmission of data trafficMoving mobile stations between base stationsClear Answer

A cellular network uses a base station to transmit and receive data to and from mobile devices. Which of the following is NOT a function of a base station?0.5 MarksTo control the power of the signal that is transmitted to mobile devicesTo connect mobile devices to the internetTo route data between mobile devicesTo provide cell coverageTo authenticate mobile devices

The BSC is a critical component of a cellular network. Which of the following is the most likely impact of a BSC failure?0.5 MarksMobile stations will be unable to roam between different cellsMobile stations will be unable to access the internetMobile stations will be unable to make or receive callsMobile stations will be unable to use voice over LTE (VoLTE)Mobile stations will be unable to receive location information

The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and every phone connects to the BTS with the strongest signal (in a little simplified view). Of course, BTSes need some attention and technicians need to check their function periodically.ACM technicians faced a very interesting problem recently. Given a set of BTSes to visit, they needed to find the shortest path to visit all of the given points and return back to the central company building. Programmers have spent several months studying this problem but with no results. They were unable to find the solution fast enough. After a long time, one of the programmers found this problem in a conference article. Unfortunately, he found that the problem is so called "Travelling Salesman Problem" and it is very hard to solve. If we have N BTSes to be visited, we can visit them in any order, giving us N! possibilities to examine. The function expressing that number is called factorial and can be computed as a product 1.2.3.4....N. The number is very high even for a relatively small N.The programmers understood they had no chance to solve the problem. But because they have already received the research grant from the government, they needed to continue with their studies and produce at least some results. So they started to study behaviour of the factorial function.For example, they defined the function Z. For any positive integer N, Z(N) is the number of zeros at the end of the decimal form of number N!. They noticed that this function never decreases. If we have two numbers N1<N2, then Z(N1) <= Z(N2). It is because we can never "lose" any trailing zero by multiplying by any positive number. We can only get new and new zeros. The function Z is very interesting, so we need a computer program that can determine its value efficiently.InputThere is a single positive integer T on the first line of input (equal to about 100000). It stands for the number of numbers to follow. Then there are T lines, each containing exactly one positive integer number N, 1 <= N <= 1000000000.OutputFor every number N, output a single line containing the single non-negative integer Z(N).ExampleSample Input:63601001024234568735373Sample Output:0142425358612183837