#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#define debug(x) print(x)
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }
template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }

int main() {
    init();

    int n; cin >> n;
    VI a(n), b(n), p(n); cin >> a >> b >> p;

    set<pair<int, int>> s; // {持てる重さ、index}
    FOR(i, 0, n) {
        --p[i];
        if (a[i] <= b[p[i]] && p[i] != i)END(-1);
        if (i != p[i]) {
            s.emplace(a[i], i);
        }
    }

    vector<pair<int, int>> ans;
    while (!s.empty()) {
        int cur = s.rbegin()->second;
        int to = p[cur];
        ans.emplace_back(cur, to);
        if (p[to] == cur) {
            s.erase(pair<int, int>(a[cur], cur));
            s.erase(pair<int, int>(a[to], to));
        }
        else {
            s.erase(pair<int, int>(a[to], to));
            p[cur] = p[to];
        }
    }

    print(ans.size());
    for (auto [x, y] : ans)print(x + 1, y + 1);

    return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define int long long
int dp[60][2];
int two_power(int x)
{
    int mul=1;
    for(int i=0;i<x;i++) mul*=2;
    return mul;
}
int32_t main()
{
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    dp[0][1]=1,dp[0][0]=0;
    int n;cin>>n;
    vector <string> s(n+1);
    for(int i=1;i<=n;i++) cin>>s[i];
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<2;j++)
        {
            if(s[i]=="AND" and j==1) dp[i][j]=dp[i-1][0]+dp[i-1][1];
            else if(s[i]=="AND" and j==0) dp[i][j]=0;
            else if(s[i]=="OR" and j==1) dp[i][j]=two_power(i);
            else if(s[i]=="OR" and j==0) dp[i][j]=dp[i-1][0]+dp[i-1][1];
        }
    }
    cout<<dp[n][1]+dp[n][0]<<endl;
    return 0;
}
/*

*/
