#include <algorithm>
#include <vector>
#include <iostream>
#include <iterator>
int main()
{
using namespace std;
int n = 5,input;
vector<int> N = { 32, 10, 22, 100, 210, 1};
vector<int> S;
int Q = 100;
auto it = std::stable_partition(N.begin(), N.end(), [&](int n) { return n < Q;});
std::copy(N.begin(), it, std::back_inserter(S));
N.erase(N.begin(), it);
for(auto& v: N)
std::cout << v << "\n";
std::cout << "\n";
for(auto& v: S)
std::cout << v << "\n";
}
I2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8aXRlcmF0b3I+CgppbnQgbWFpbigpCnsKICAgIHVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAgICBpbnQgbiA9IDUsaW5wdXQ7CiAgICB2ZWN0b3I8aW50PiBOID0geyAzMiwgMTAsIDIyLCAxMDAsIDIxMCwgMX07CiAgICB2ZWN0b3I8aW50PiBTOwogICAgaW50IFEgPSAxMDA7CiAgICBhdXRvIGl0ID0gc3RkOjpzdGFibGVfcGFydGl0aW9uKE4uYmVnaW4oKSwgTi5lbmQoKSwgWyZdKGludCBuKSB7IHJldHVybiBuIDwgUTt9KTsKICAgIHN0ZDo6Y29weShOLmJlZ2luKCksIGl0LCBzdGQ6OmJhY2tfaW5zZXJ0ZXIoUykpOwogICAgTi5lcmFzZShOLmJlZ2luKCksIGl0KTsKICAgIGZvcihhdXRvJiB2OiBOKQogICAgICAgc3RkOjpjb3V0IDw8IHYgPDwgIlxuIjsKICAgIHN0ZDo6Y291dCA8PCAiXG4iOwogICAgZm9yKGF1dG8mIHY6IFMpCiAgICAgICBzdGQ6OmNvdXQgPDwgdiA8PCAiXG4iOwogICAgCn0=