#include <bits/stdc++.h>
using namespace std;
long long int expo(long long int base, long long int exponent,
                   long long int mod) {
  long long int ans = 1;
  while (exponent != 0) {
    if ((exponent & 1) == 1) {
      ans = ans * base;
      ans = ans % mod;
    }
    base = base * base;
    base %= mod;
    exponent >>= 1;
  }
  return ans;
}
void solve() {
  int second, a, b, c;
  cin >> second >> a >> b >> c;
  cout.precision(15);
  if (a == 0 && b == 0 && c == 0) {
    cout << 0 << " " << 0 << " " << 0;
    return;
  } else if (a == 0 && b == 0) {
    cout << 0 << " " << 0 << " " << second;
    return;
  } else if (a == 0 && c == 0) {
    cout << 0 << " " << second << " " << 0;
    return;
  } else if (b == 0 && c == 0) {
    cout << second << " " << 0 << " " << 0;
    return;
  } else if (a == 0) {
    cout << 0 << " " << (long double)second / (b + c) * b << " "
         << (long double)second / (b + c) * c;
    return;
  } else if (b == 0) {
    cout << (long double)second / (a + c) * a << " " << 0 << " "
         << (long double)second / (a + c) * c;
    return;
  } else if (c == 0) {
    cout << (long double)second / (b + a) * a << " "
         << (long double)second / (b + a) * b << " " << 0;
    return;
  } else {
    cout << (long double)second / (b + c + a) * a << " "
         << (long double)second / (b + c + a) * b << " "
         << (long double)second / (b + c + a) * c;
    return;
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
