Tartak
After the oak tree where the Owl lived fell, she needed a new home. With no trees left that had large, convenient hollows, the Owl decided to cut several old, dried trees into logs.
Not wanting to do the sawing herself, she visited the nearest sawmill. This sawmill, like many others, uses advanced technology—it is equipped with an automatic log cutter. This cutter features a very long ruler for measuring coordinates, a tree trunk holder, and n stationary laser saws. The left end of the trunk to be cut is fixed at a specific point, and the trunk is cut wherever the coordinates align with those of the saws.
The Owl needs logs for building a house that are at least a in length and at most b. For each tree trunk she has, the Owl wants to know if it can be cut at the sawmill into logs of these lengths.
Input
The first line of the input file contains one integer n (1 ≤ n ≤ 10^6)—the number of saws at the sawmill. The next line contains n integers x_i (|x_i| ≤ 10^9)—the coordinates of the ith saw. All saw coordinates are distinct.
The following line contains three integers: l (1 ≤ l ≤ 10^9)—the length of the trunk the Owl wants to cut, and a and b (1 ≤ a ≤ b ≤ 10^9)—the minimum and maximum lengths of the logs suitable for the Owl.
Output
In the output file, print one integer—the coordinate of the point where the left end of the log should be set so that it can be cut into logs suitable for the Owl. If no such point exists, print No solution.