说明：  圣诞岛的旅行 Problem Angel最近无聊，去了圣诞岛(CX *^_^*)，他喜欢无目的的乱逛，当然，他不会轻易地回头。Angel想去广场，那么，他什么时候才能到呢？你已经得到了CX的地图，地图上有N(N <= 100)个交叉路口，交叉路口之间有马路相连接(不超过1000条马路)。因为CX的人遵循奇怪的规则，道路都是单向的，不同的道路之间有一定的距离，我们假设Angel所在的地点为点1，广场所在点为N。假设Angel走一单位距离需要一单位时间。问Angel最早和最迟什么时候到达广场？
(Christmas Island' s recent trip Boring Problem Angel, went to the Christmas Island (CX*^_^*), likes him乱逛without purpose, of course, he will not easily go back. Angel wanted to go plaza, then when he get to do? CX you have been a map, the map has N (N < = 100) were at the crossroads, the crossroads between the road has connected (not more than 1000 street). CX' s because people follow the strange rules of the road are one-way, between different roads must have the distance, we assume that the location of Angel for point 1, the square where the point of N. Assuming one unit of Angel walking distance required one unit of time. Angel ask when the earliest and latest arrival plaza?)