#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } string result(n, '0'); for (int start = 0; start < n; start++) { vector<int> temp = a; bool valid = true; for (int i = 0; i < n; i++) { int pos = (start + i) % n; int next_pos = (pos + 1) % n; if (temp[pos] == 0 && temp[next_pos] == 0) { continue; } int min_val = min(temp[pos], temp[next_pos]); temp[pos] -= min_val; temp[next_pos] -= min_val; } // 检查是否所有元素都变为0 for (int i = 0; i < n; i++) { if (temp[i] != 0) { valid = false; break; } } if (valid) { result[start] = '1'; } } cout << result << endl; return 0; }