#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) int idx,
               __attribute__((unused)) int LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
const double PI = 3.14159265358979323846;
const double eps = (1e-8);
enum { LESS, EQUAL, GREATER };
int dcmp(long double x, long double y, long double EPS = eps) {
  if (fabs(x - y) <= EPS) return EQUAL;
  return x > y ? GREATER : LESS;
}
struct Point {
  long double x, y, z;
  Point operator-(Point other) const {
    return {x - other.x, y - other.y, z - other.z};
  }
  Point operator+(Point other) const {
    return {x + other.x, y + other.y, z + other.z};
  }
  Point operator*(long double s) const { return {x * s, y * s, z * s}; }
  long double len() const { return sqrt(x * x + y * y + z * z); }
  long double dist(Point other) const { return (other - (*this)).len(); }
  friend ostream& operator<<(ostream& out, Point p) {
    out << p.x << " " << p.y << " " << p.z;
    return out;
  }
};
int n;
const int MAX_N = 1e4 + 5;
Point a[MAX_N], H;
int vH, vS;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  ++n;
  long double sumDist = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i].x >> a[i].y >> a[i].z;
    if (i) sumDist += a[i].dist(a[i - 1]);
  }
  cin >> vH >> vS;
  cin >> H.x >> H.y >> H.z;
  long double elapsedTime = 0;
  for (int i = 0; i < n - 1; ++i) {
    long double segment = a[i + 1].dist(a[i]) / vS;
    long double harry = H.dist(a[i + 1]) / vH;
    if (dcmp(harry, elapsedTime + segment) != GREATER) {
      long double st = 0, en = 1;
      Point diff = a[i + 1] - a[i];
      for (int j = 0; j < 500; ++j) {
        long double mid = (st + en) / 2;
        Point p = a[i] + diff * mid;
        if (dcmp(H.dist(p) / vH, elapsedTime + mid * segment, 1e-15) != GREATER)
          en = mid;
        else
          st = mid;
      }
      cout << "YES\n";
      Point p = a[i] + diff * st;
      cout << fixed << setprecision(10);
      cout << H.dist(p) / vH << '\n' << p << '\n';
      return 0;
    }
    elapsedTime += segment;
  }
  cout << "NO\n";
}
