求关

#include <bits/stdc++.h>
using namespace std;
int main(){
int a[40] = {};
int ou[40] = {};
int ji[40] = {};
int n;
cin >> n;
for(int i = 1;i<= n;i++){
cin >> a[i];
}
int o = 1;
for(int i = 1;i <= n;i++){
if(a[i] % 2 == 0){
ou[o] = a[i];
o++;
}
else{
o++;
}
}
int k = 1;
for(int i = 1;i <= n;i++){
if(a[i] % 2 == 1){
ji[k] = a[i];
k++;
}
else{
k++;
}
}
for(int i = 1;i <= k;i++){
if(ji[i] != 0){
cout << ji[i] << " ";
}
}
cout << endl;
for(int i = 1;i <= o;i++){
if(ou[i] != 0){
cout << ou[i] << " ";
}
}
return 0;
}