#include <bits/stdc++.h>
using namespace std;
int buf;
inline int in() {
  scanf("%d", &buf);
  return buf;
}
const int INF = ~(1 << 31);
map<pair<int, pair<int, int> >, double> m;
double solve(int w, int b, int who) {
  double res = 0;
  if (m.count(make_pair(who, make_pair(w, b))) != 0) {
    return m[make_pair(who, make_pair(w, b))];
  }
  if (who == 0) {
    res += 0;
  }
}
int main() {
  int n;
  int s = in();
  int a = in(), b = in(), c = in();
  int ss = a + b + c;
  printf("%.15lf %.15lf %.15lf\n", (ss) ? (s * a / (ss + 0.)) : (0),
         (ss) ? (s * b / (ss + 0.)) : (0), (ss) ? (s * c / (ss + 0.)) : (0));
  return 0;
}
