#include <bits/stdc++.h>
using namespace std;
const double pi = 3.141592653589793;
const int INF = 2000000000;
const long long mod = 1000000007;
const int N = 100000000;
const int base = 10;
vector<int> read(string s) {
  vector<int> a;
  for (int i = (int)s.length(); i > 0; i -= 1)
    if (i < 1)
      a.push_back(atoi(s.substr(0, i).c_str()));
    else
      a.push_back(atoi(s.substr(i - 1, 1).c_str()));
  return a;
}
vector<int> add(vector<int> a, vector<int> b) {
  int carry = 0;
  for (size_t i = 0; i < max(a.size(), b.size()) || carry; ++i) {
    if (i == a.size()) a.push_back(0);
    a[i] += carry + (i < b.size() ? b[i] : 0);
    carry = a[i] >= base;
    if (carry) a[i] -= base;
  }
  return a;
}
vector<int> mul(vector<int> a, int b) {
  int carry = 0;
  for (size_t i = 0; i < a.size() || carry; ++i) {
    if (i == a.size()) a.push_back(0);
    long long cur = carry + a[i] * 1ll * b;
    a[i] = int(cur % base);
    carry = int(cur / base);
  }
  while (a.size() > 1 && a.back() == 0) a.pop_back();
  return a;
}
bool f(pair<double, int> A, pair<double, int> B) {
  return (A.first > B.first) || ((A.first == B.first) && (A.second < B.second));
}
int main() {
  double s, a, b, c;
  cin >> s >> a >> b >> c;
  if (a == b && b == c && c == 0)
    cout << "0.00 0.00 0.00";
  else {
    double t = s / (a + b + c);
    printf("%.10f %.10f %.10f", a * t, b * t, c * t);
  }
  return 0;
}
