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 CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize(2)
namespace ucp {
template <typename T>
void Min(T &a, T b) {
  if (a > b) a = b;
}
template <typename T>
void Max(T &a, T b) {
  if (a < b) a = b;
}
inline int read() {
  int sign, data = 0;
  char ch = 0;
  while ((ch != '-') && ch < '0' || ch > '9') ch = getchar();
  if (ch == '-') {
    sign = -1;
    ch = getchar();
  } else
    sign = 1;
  while (ch >= '0' && ch <= '9') {
    data = data * 10 + ch - '0';
    ch = getchar();
  }
  return data * sign;
}
inline void print(int x) {
  if (x / 10) print(x / 10);
  putchar(x % 10 + '0');
}
}  // namespace ucp
using namespace std;
using namespace ucp;
const int mxint = 0x3f3f3f3f;
const long long mxll = 1e16;
const int lim = 5e5 + 10;
const int maxn = 10000 + 10;
const int maxm = 5e4 + 10;
const int N = 3e4 + 1000;
const long long mod = 1e9 + 7;
const double mxdb = 1e18;
const double eps = 1e-11;
struct node {
  double x, y, z;
  node() {}
  node(double x, double y, double z) : x(x), y(y), z(z) {}
  friend bool operator==(const node &a, const node &b) {
    return ((fabs(a.x - b.x) <= eps) && (fabs(a.y - b.y) <= eps) &&
            (fabs(a.z - b.z) <= eps));
  }
  friend node operator-(const node &a, const node &b) {
    node res;
    res.x = a.x - b.x;
    res.y = a.y - b.y;
    res.z = a.z - b.z;
    return res;
  }
  double lenth() { return sqrt(x * x + y * y + z * z); }
} point[maxn];
int n;
node pd;
node ans1;
double ans2;
double vc, vd;
double dis(node &a, node &b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y) +
              (a.z - b.z) * (a.z - b.z));
}
vector<double> ve, cost;
bool check(double t) {
  int id = lower_bound(cost.begin(), cost.end(), t) - cost.begin();
  double tleft = t - cost[id - 1];
  node vv = point[id] - point[id - 1];
  double lenth = vv.lenth();
  node now;
  now.x = vc * tleft * vv.x / (lenth) + point[id - 1].x;
  now.y = vc * tleft * vv.y / (lenth) + point[id - 1].y;
  now.z = vc * tleft * vv.z / (lenth) + point[id - 1].z;
  double dist = dis(now, pd);
  double td = dist / vd;
  if (td - t > eps * 2) return false;
  if (t < ans2) {
    ans1 = now;
    ans2 = t + eps;
  }
  return true;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i <= n; ++i) {
    scanf("%lf%lf%lf", &point[i].x, &point[i].y, &point[i].z);
  }
  scanf("%lf%lf", &vd, &vc);
  scanf("%lf%lf%lf", &pd.x, &pd.y, &pd.z);
  double sum = 0;
  ve.clear();
  cost.clear();
  cost.push_back(0.0);
  for (int i = 0; i < n; ++i) {
    ve.push_back(dis(point[i], point[i + 1]));
    sum = sum + ve[i];
    cost.push_back(ve[i] / vc);
  }
  for (int i = 1; i <= n; ++i) {
    cost[i] += cost[i - 1];
  }
  double l = 0, r = cost[n];
  ans2 = r + 1;
  while ((r - l) >= eps) {
    double mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  if (fabs(ans2 - (r + 1)) <= eps) {
    puts("NO");
  } else {
    puts("YES");
    printf("%.8lf\n", ans2);
    printf("%.8lf %.8lf %.8lf ", ans1.x, ans1.y, ans1.z);
  }
  return 0;
}