// includes #include using namespace std; // macros #define pb emplace_back #define mk make_pair #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define whole(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define bit(n) (1LL<<(n)) #define F first #define S second // functions template void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());} template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template istream &operator>>(istream &is, vector &vec){for(auto &v: vec)is >> v; return is;} template ostream &operator<<(ostream &os, const vector& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template ostream &operator<<(ostream &os, const set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const pair &p){os << "(" << p.first << ", " << p.second << ")"; return os;} template ostream &operator<<(ostream &os, const map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template ostream &operator<<(ostream &os, const unordered_map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types using ll = long long int; using P = pair; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1000000007; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // io struct fast_io{ fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);} } fast_io_; const int MAX_H = 510, MAX_W = 510; struct MatrixB { int H, W; bitset val[MAX_H]; MatrixB(int m = 1, int n = 1): H(m), W(n){} inline bitset& operator[](size_t i){return val[i];} int gauss_jordan(bool is_extended = false){ int rank = 0; for(int col = 0; col < W; col++){ if(col == W - 1 && is_extended)break; int pivot = -1; for(int row = rank; row < H; row++){ if(val[row][col]){ pivot = row; break; } } if(pivot == -1)continue; swap(val[pivot], val[rank]); for(int row = 0; row < H; row++){ if(row != rank && val[row][col])val[row] ^= val[rank]; } rank++; } return rank; } }; int linear_eq(MatrixB &A, vector b, vector & res){ int m = A.H, n = A.W; MatrixB M(m, n + 1); for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++){ M[i][j] = A[i][j]; } M[i][n] = b[i]; } int rank = M.gauss_jordan(true); for(int row = rank; row < m; row++){ if(M[row][n])return -1; } res.assign(n, 0); for(int i = 0; i < rank; i++)res[i] = M[i][n]; return rank; } int main(int argc, char const* argv[]) { int n; cin >> n; vector d(n); cin >> d; vector w(n); cin >> w; rep(i, n)w[i] = 1 - w[i]; MatrixB m(n, n); rep(i, n){ int l = (i + d[i]) % n; int r = (i - d[i]) % n; if(r < 0)r += n; m[i][l] = 1; m[i][r] = 1; } vector res; auto r = linear_eq(m, w, res); if(r > 0)cout << "Yes" << endl; else cout << "No" << endl; return 0; }