#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    vector<int> v;
    int x, firstPositive = -1;
    while(cin >> x){
        v.push_back(x);
        if(x >= 0 && firstPositive == -1){
            firstPositive = v.size() - 1;
        }
    }
    for(int i = 0; i < v.size(); i++){
        if(v[i] < 0 && i > firstPositive && firstPositive != -1) {
            swap(v[i], v[firstPositive]);
            for(int j = firstPositive; j < v.size(); j++){
                if(v[j] >= 0){
                    firstPositive = j;
                    break;
                }
            }
        }
    }
    int pos = -1;
    for(vector<int>::iterator it = v.begin(); it != v.end(); it++){
        if(*it >= 0){
            reverse(v.begin(), it);
            break;
        }
    }
    for(int i = 0; i < v.size(); i++){
        cout << v[i] << " ";
    }
    return 0;
}
/*
-8 7 9 2 -2 1 -1 9 -5 2 -8 1 8 1 -5 0 2 5 6 6 9 -6 -3 -4 0 7 2 6 0 7 -4 0 1 -5 -9 2 9 -3 -5 7 6 9 -8 -7 -4 1 -6 -4 5 -1
*/