There are N cities spread in the form of circle. There is road connectivity b/w city 1 and 2, then city 2 and 3 and so on till city n and 1. Each ith city has a petrol pump where you can pick pith petrol and distance between ith and i+1 th city is di . Assume you car has a mileage of 1km/litre. You have to find out if there exist any city, if you start from that city then you can visit all the cities either in the clockwise or anticlockwise fashion