PROGRAMMING:Class queuing
Xiao Yang is the monitor of a new high in his class. Teacher Wang assigned Xiao Yang a task, asking that the boys and girls in the class should be ranked from short to high, and the girls should be in front of the boys.
###Input format:
In the first line, enter a positive integer n to represent the number of students in the class, 1 < = n < = 5000.
In the second line, enter n integers to represent the height of each person in the class, in cm.
In the third line, enter n numbers, 0 for boys and 1 for girls.
###Output format:
The height of each person after ranking.
###Input example:
```in
ten
159 187 176 155 163 167 179 182 160 167
1 0 0 1 0 1 1 0 1 0
```
###Output example:
```out
155 159 160 167 179 163 167 176 182 187
```
###Scale and convention of evaluation case
For 20% of the evaluation cases, 1 ≤ n ≤ 10.
For 50% of the evaluation cases, 1 ≤ n ≤ 100.
For 80% of the evaluation cases, 1 ≤ n ≤ 1000.
For all evaluation cases, 1 ≤ n ≤ 10000< br>
answer：If there is no answer, please comment
###Input format:
In the first line, enter a positive integer n to represent the number of students in the class, 1 < = n < = 5000.
In the second line, enter n integers to represent the height of each person in the class, in cm.
In the third line, enter n numbers, 0 for boys and 1 for girls.
###Output format:
The height of each person after ranking.
###Input example:
```in
ten
159 187 176 155 163 167 179 182 160 167
1 0 0 1 0 1 1 0 1 0
```
###Output example:
```out
155 159 160 167 179 163 167 176 182 187
```
###Scale and convention of evaluation case
For 20% of the evaluation cases, 1 ≤ n ≤ 10.
For 50% of the evaluation cases, 1 ≤ n ≤ 100.
For 80% of the evaluation cases, 1 ≤ n ≤ 1000.
For all evaluation cases, 1 ≤ n ≤ 10000< br>
answer：If there is no answer, please comment