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

int main()
{
int input;
std::vector <int> numbers = {};
std::vector <int> evenNumber = {};
std::vector <int> unevenNumber = {};

    do {
        std::cin >> input;
        numbers.push_back(input);
    } while (input >= 0);

    for (int i = 0; i < numbers.size(); i++) {
        if (numbers[i]%2 == 0) {
            evenNumber.push_back(numbers[i]);
        } else {
            unevenNumber.push_back(numbers[i]);
        }
    }

    std::cout << "Najmniesza liczba parzysta: " << *std::min_element (std::begin(evenNumber), std::end(evenNumber)) << "\n";
    for (int j = 0; j < evenNumber.size(); j++) {
        std::cout << evenNumber[j] << ", ";
    }
    std::cout << "\n";
    sort (std::begin(evenNumber), std::end(evenNumber));
    for (auto x : evenNumber) {
        std::cout << x;
    }
    std::cout << "\n";
    std::cout << "Ilosc elemntow nieparzystych: " << unevenNumber.size() << "\n";
    for (int k = 0; k < unevenNumber.size(); k++) {
        std::cout << unevenNumber[k] << ", ";
    }

    return 0;
}