qsort_pos

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <string.h>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <sstream>
#include <ctime>

#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define ALL(x) x.begin(), x.end()
#define F first
#define S second
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,-1,sizeof(x))
#define pw(x) (1ull<<(x))

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
const int INF = 2147483647;
const ll LLINF = 9223372036854775807LL;

vector<double> a;
vector<double> positive;

int main() {
  //input
  double q;
  while (cin >> q) {
    a.push_back(q);
  }
  //select positive and sort
  for (size_t i = 0; i < a.size(); i++) {
    if (a[i] > 0) positive.push_back(a[i]);
  }
  sort(positive.begin(), positive.end());

  //output
  int current = 0;
  for (size_t i = 0; i < a.size(); i++) {
    if (a[i] > 0) a[i] = positive[current++];
  }
  for (size_t i = 0; i < a.size(); i++) cout << a[i] << " ";

  return 0;
}