Problem: Brothers Fred and George Weasley once got into the sporting goods store and opened a box of Quidditch balls. After long and painful experiments they found out that the Golden Snitch is not enchanted at all. It is simply a programmed device. It always moves along the same trajectory, which is a polyline with vertices at the points (x0, y0, z0), (x1, y1, z1), ..., (xn, yn, zn). At the beginning of the game the snitch is positioned at the point (x0, y0, z0), and then moves along the polyline at the constant speed vs. The twins have not yet found out how the snitch behaves then. Nevertheless, they hope that the retrieved information will help Harry Potter and his team in the upcoming match against Slytherin. Harry Potter learned that at the beginning the game he will be at the point (Px, Py, Pz) and his super fast Nimbus 2011 broom allows him to move at the constant speed vp in any direction or remain idle. vp is not less than the speed of the snitch vs. Harry Potter, of course, wants to catch the snitch as soon as possible. Or, if catching the snitch while it is moving along the polyline is impossible, he wants to hurry the Weasley brothers with their experiments. Harry Potter catches the snitch at the time when they are at the same point. Help Harry.

Input

The first line contains a single integer n (1 ≤ n ≤ 10000). The following n + 1 lines contain the coordinates xi, yi, zi, separated by single spaces. The coordinates of any two consecutive points do not coincide. The next line contains the velocities vp and vs, the last line contains Px, Py, Pz, separated by single spaces. All the numbers in the input are integers, their absolute value does not exceed 104. The speeds are strictly positive. It is guaranteed that vs ≤ vp.

Output

If Harry Potter can catch the snitch while it is moving along the polyline (including the end (xn, yn, zn)), print "YES" in the first line (without the quotes). Print in the second line t, which is the earliest moment of time, when Harry will be able to catch the snitch. On the third line print three numbers X, Y, Z, the coordinates of the point at which this happens. The absolute or relative error in the answer should not exceed 10 - 6. If Harry is not able to catch the snitch during its moving along the described polyline, print "NO".

Examples

Input

4
0 0 0
0 10 0
10 10 0
10 0 0
0 0 0
1 1
5 5 25


Output

YES
25.5000000000
10.0000000000 4.5000000000 0.0000000000


Input

4
0 0 0
0 10 0
10 10 0
10 0 0
0 0 0
1 1
5 5 50


Output

NO


Input

1
1 2 3
4 5 6
20 10
1 2 3


Output

YES
0.0000000000
1.0000000000 2.0000000000 3.0000000000

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class C 
{
	static double dist(double[] a, double[] b)
	{
		double sum = 0;
		for (int j = 0; j < 3; ++j) 
		{
			double dx = a[j] - b[j];
			sum += dx*dx;
		}
		return Math.sqrt(sum);
	}
	public static void main(String[] args) throws Exception
	{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(in.readLine().trim());
		double[][] ps = new double[N+1][3];
		for (int i = 0; i < N+1; ++i)
		{
			String[] toks = in.readLine().trim().split("\\s+");
			for (int j = 0; j < 3; ++j) ps[i][j] = Double.parseDouble(toks[j]);
		}
		String[] toks = in.readLine().trim().split("\\s+");
		int vp = Integer.parseInt(toks[0]), vs = Integer.parseInt(toks[1]);
		double[] harry = new double[3];
		toks = in.readLine().trim().split("\\s+");
		for (int i = 0; i < 3; ++i) harry[i] = Double.parseDouble(toks[i]);
		double dist = 0;
		for (int i = 1; i < N+1; ++i)
		{
			dist += dist(ps[i-1],ps[i]);
		}
		double R = dist/vs, L = 0;
		if (dist(harry, ps[N])/vp > R + 1e-9)
		{
			System.out.println("NO");
			return;
		}
		double[] midp = new double[3];
		for (int X = 0; X < 200; ++X)
		{
			double M = (R+L)/2;
			double far = M*vs;
			int i = 1;
			double sum = 0;
			while (true)
			{
				if (i >= ps.length) break;
				double d = dist(ps[i],ps[i-1]);
				if (sum + d > far) break;
				sum += d;
				++i;
			}
			if (i >= ps.length)
			{
				R = M;
				continue;
			}
			double frac = (far-sum)/dist(ps[i],ps[i-1]);
			for (int j = 0; j < 3; ++j) midp[j] = ps[i-1][j] + frac*(ps[i][j] - ps[i-1][j]);
			if (dist(midp,harry)/vp > M) L = M;
			else R = M;
		}
		System.out.println("YES");
		System.out.println(R);
		for (int i = 0; i < 3; ++i) 
		{
			if (i > 0) System.out.print(" ");
			System.out.print(midp[i]);
		}
		System.out.println();
	}

}