#include <iostream>

using namespace std;

int main()
{
    int count_pos_P, sum_chetnix_T;
    int n, m, x1, x2, x;
    /*cin >> n;
    cout << endl;
    cin >> m;*/
    count_pos_P=0;
    sum_chetnix_T= 0;
    n = 10;
    m = 7;
    x1 = 0;
    x2 = 0;

    int P[n]{0,-10,23,45,-97,-52,-100,23,76,96};
    int T[m]{4,-11,45,-65,37,-98,1};

    for(int i = 0; i < n; i++)
    {
        if (P[i]>0)
        {
            x1+=1;
            if (i%2 == 0)
            {
                count_pos_P += 1;
            }
        }
    }

    for(int i = 0 ; i < m; i++)
    {
        if ((i%2 == 0) && (i>= m/2))
        {
            sum_chetnix_T += T[i];
        }

        if (T[i]%2 == 0)
        {
            x2+=1;
        }
    }


    x = x1+x2;
    int X[x];

    int i1 = 0;
    for(int i = 0; i < n; i++)
    {
        if (P[i]>0)
        {
            X[i1] = P[i];
            i1+=1;

        }
    }

    int i2 = x1;
    for(int i = 0 ; i < m; i++)
    {
        if (T[i]%2 == 0)
        {
            X[x1] = T[i];
            x1+=1;
        }
    }
    for(int i = 0; i < x; i++)
    {
        cout << X[i];
        cout << " ";
    }

    cout << endl;

    int minimal = X[0];
    int index_min = 0;
    for (int i = 1; i < x; i++)
    {
        if (X[i] < minimal)
        {
            minimal = X[i];
            index_min = i;
        }
    }

    int X1[x-1];
    int i3 = 0;
    for (int i = 0; i < x-1; i++)
    {
        if (i == minimal)
        {
            continue;
        }
        else{
            X1[i3] = X[i];
            i3+=1;
        }
    }

    for(int i = 0; i < x-1; i++)
    {
        cout << X1[i];
        cout << " ";
    }

    return 0;
}