#include <bits/stdc++.h>
using namespace std;
struct POINT {
  double x, y, z;
} P[10005], S;
int n;
double vp, vs;
double Ts[10005], Tp[10005];
double dist(POINT a, POINT 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));
}
POINT padd(POINT a, POINT b) {
  POINT tmp;
  tmp.x = a.x + b.x;
  tmp.y = a.y + b.y;
  tmp.z = a.z + b.z;
  return tmp;
}
POINT pmult(double c, POINT a) {
  POINT tmp;
  tmp.x = c * a.x;
  tmp.y = c * a.y;
  tmp.z = c * a.z;
  return tmp;
}
void getTimes() {
  double length = 0;
  Ts[0] = 0;
  for (int i = 1; i <= n; i++) {
    length += dist(P[i], P[i - 1]);
    Ts[i] = length / vs;
  }
  for (int i = 0; i <= n; i++) {
    Tp[i] = dist(S, P[i]) / vp;
  }
}
POINT X0, X1;
double t0, t1;
double binSearch(double a, double b) {
  POINT left = padd(pmult(1 - a, X0), pmult(a, X1));
  POINT right = padd(pmult(1 - b, X0), pmult(b, X1));
  if (abs(((1 - a) * t0 + a * t1) - ((1 - b) * t0 + b * t1)) < 1e-9 &&
      dist(left, right) < 1e-9)
    return (1 - a) * t0 + a * t1;
  double m = (a + b) / 2;
  POINT mid = padd(pmult(1 - m, X0), pmult(m, X1));
  double harry_arrival = dist(mid, S) / vp;
  double snitch_arrival = (1 - m) * t0 + m * t1;
  if (snitch_arrival < harry_arrival)
    return binSearch(m, b);
  else
    return binSearch(a, m);
}
int main() {
  cin >> n;
  for (int i = 0; i <= n; i++) cin >> P[i].x >> P[i].y >> P[i].z;
  cin >> vp >> vs;
  cin >> S.x >> S.y >> S.z;
  getTimes();
  for (int i = 0; i <= n; i++) {
    if (Tp[i] <= Ts[i]) {
      cout << "YES" << endl;
      double res = 0;
      POINT hit;
      hit.x = P[0].x;
      hit.y = P[0].y;
      hit.z = P[0].z;
      if (i > 0) {
        X0 = P[i - 1];
        X1 = P[i];
        t0 = Ts[i - 1];
        t1 = Ts[i];
        res = binSearch(0, 1);
        double l = (res - t0) / (t1 - t0);
        hit = padd(pmult(1 - l, X0), pmult(l, X1));
      }
      printf("%.8f\n", res);
      printf("%.8f %.8f %.8f\n", hit.x, hit.y, hit.z);
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
