#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
int use[N];
struct fruit{
	int id,v;
	int cui = 0;
}b[N * 2];
int n;
int main(){
	scanf("%d",&n);
	for (int i = 1;i <= n;++i){
		scanf("%d",&b[i].v);
		b[i].id = i;
	}
	int yy = 0;
	while (1){
		int flag = 1;
		for (int i = 1;i <= n;++i){
			if (b[i].cui == 0){
				flag = b[i].v;
				break;
			}
		}
		int glue = 0;
		if (yy >= n)break;
        for (int i = 1;i <= n;++i){
		    if (b[i].v == flag && b[i].cui == 0){
			    glue++;
		        use[glue] = b[i].v;
		        flag = abs(flag - 1);
		        b[i].cui++;
		        yy++;
		    }else if (b[i].cui == 1){
			    b[i].cui++;
		    }
	    }
	    for (int i = 1;i <= n;++i){
		    if (b[i].cui == 1){
			    printf("%d ",b[i].id);
		    }
	    }
	    printf("\n");
	}
	return 0;
}

提交记录