#include<bits/stdc++.h> 
using namespace std; 

class Node  
{  
    public: 
    long long int key;  
    Node *left;  
    Node *right;  
    long long int height;
    long long int amount;
};  
  
long long int height(Node *N)  
{  
    if (N == NULL)  
        return 0;  
    return N->height;  
}  

long long int max(long long int a, long long int b)  
{  
    return (a > b)? a : b;  
}  

Node* newNode(long long int key)  
{  
    Node* node = new Node(); 
    node->key = key;  
    node->left = NULL;  
    node->right = NULL;  
    node->height = 1; // new node is initially 
                      // added at leaf  
    node->amount = 1;
    return(node);  
}  
 
Node *rightRotate(Node *y)  
{  
    Node *x = y->left;  
    Node *T2 = x->right;  
  
    x->right = y;  
    y->left = T2;  
  
    y->height = max(height(y->left),  
                    height(y->right)) + 1;  
    x->height = max(height(x->left),  
                    height(x->right)) + 1;  
 
    return x;  
}  
   
Node *leftRotate(Node *x)  
{  
    Node *y = x->right;  
    Node *T2 = y->left;  
  
    y->left = x;  
    x->right = T2;  
 
    x->height = max(height(x->left),  
                    height(x->right)) + 1;  
    y->height = max(height(y->left),  
                    height(y->right)) + 1;  

    return y;  
}  
  
long long int getBalance(Node *N)  
{  
    if (N == NULL)  
        return 0;  
    return height(N->left) -  
           height(N->right);  
}  
  
Node* insert(Node* node, long long int key)  
{  
    /* 1. Perform the normal BST rotation */
    if (node == NULL)  
        return(newNode(key));  
  
    if (key < node->key)  
        node->left = insert(node->left, key);  
    else if (key > node->key)  
        node->right = insert(node->right, key);  
    else // Equal keys not allowed  
    {   
        node->amount++;
        return node;  
    }
  
    /* 2. Update height of this ancestor node */
    node->height = 1 + max(height(node->left),  
                           height(node->right));  
  
    /* 3. Get the balance factor of this  
        ancestor node to check whether  
        this node became unbalanced */
    long long int balance = getBalance(node);  
  
    // If this node becomes unbalanced, 
    // then there are 4 cases  
  
    // Left Left Case  
    if (balance > 1 && key < node->left->key)  
        return rightRotate(node);  
  
    // Right Right Case  
    if (balance < -1 && key > node->right->key)  
        return leftRotate(node);  
  
    // Left Right Case  
    if (balance > 1 && key > node->left->key)  
    {  
        node->left = leftRotate(node->left);  
        return rightRotate(node);  
    }  
  
    // Right Left Case  
    if (balance < -1 && key < node->right->key)  
    {  
        node->right = rightRotate(node->right);  
        return leftRotate(node);  
    }  
  
    /* return the (unchanged) node pointer */
    return node;  
}  

Node * minValueNode(Node* node)  
{  
    Node* current = node;  
  
    while (current->left != NULL)  
        current = current->left;  
  
    return current;  
}  

Node* deleteNode(Node* root, long long int key)  
{  
      
    // STEP 1: PERFORM STANDARD BST DELETE  
    if (root == NULL)  
        return root;  
  
    // If the key to be deleted is smaller  
    // than the root's key, then it lies 
    // in left subtree  
    if ( key < root->key )  
        root->left = deleteNode(root->left, key);  
  
    // If the key to be deleted is greater  
    // than the root's key, then it lies  
    // in right subtree  
    else if( key > root->key )  
        root->right = deleteNode(root->right, key);  
  
    // if key is same as root's key, then  
    // This is the node to be deleted  
    else if(root -> amount > 1){
        root->amount--;
        return root;
    }
    else
    {  
        // node with only one child or no child  
        if( (root->left == NULL) || 
            (root->right == NULL) )  
        {  
            Node *temp = root->left ?  
                         root->left :  
                         root->right;  
  
            // No child case  
            if (temp == NULL)  
            {  
                temp = root;  
                root = NULL;  
            }  
            else // One child case  
            *root = *temp; // Copy the contents of  
                           // the non-empty child  
            free(temp);  
        }  
        else
        {  
            // node with two children: Get the inorder  
            // successor (smallest in the right subtree)  
            Node* temp = minValueNode(root->right);  
  
            // Copy the inorder successor's  
            // data to this node  
            root->key = temp->key;  
  
            // Delete the inorder successor  
            root->right = deleteNode(root->right,  
                                     temp->key);  
        }  
    }  
  
    // If the tree had only one node 
    // then return  
    if (root == NULL)  
    return root;  
  
    // STEP 2: UPDATE HEIGHT OF THE CURRENT NODE  
    root->height = 1 + max(height(root->left),  
                           height(root->right));  
  
    // STEP 3: GET THE BALANCE FACTOR OF  
    // THIS NODE (to check whether this  
    // node became unbalanced)  
    long long int balance = getBalance(root);  
  
    // If this node becomes unbalanced,  
    // then there are 4 cases  
  
    // Left Left Case  
    if (balance > 1 &&  
        getBalance(root->left) >= 0)  
        return rightRotate(root);  
  
    // Left Right Case  
    if (balance > 1 &&  
        getBalance(root->left) < 0)  
    {  
        root->left = leftRotate(root->left);  
        return rightRotate(root);  
    }  
  
    // Right Right Case  
    if (balance < -1 &&  
        getBalance(root->right) <= 0)  
        return leftRotate(root);  
  
    // Right Left Case  
    if (balance < -1 &&  
        getBalance(root->right) > 0)  
    {  
        root->right = rightRotate(root->right);  
        return leftRotate(root);  
    }  
  
    return root;  
} 

long long int find_lower(Node* root, long long int key){
    Node* last_right_turn = NULL;
    while(true){

        if(root == NULL)
            if(last_right_turn != NULL)
                return last_right_turn->key;
            else
                return 0;
        if ( key - 1 < root->key ) 
            root = root->left; 
    
        else if( key - 1 > root->key ){
            last_right_turn = root;
            root = root->right;
        }  
        else if(key - 1 == root->key)
            return root->key;
    }

}


int main()  {  
    ios_base::sync_with_stdio(false);
    
    Node *root = NULL;  
    long long int n, q;
    cin>>n;

    for(long long int i = 0; i<n; i++){
        long long int w;
        cin>>w;
        root = insert(root, w);
    }

    cin>>q;

    for(long long int i=0; i<q; i++){
        long long int event;
        cin>>event;
        if(event == 1){
            long long int s, k;
            cin>>s>>k;
            long long int result = 0;
            vector<long long int> fishes;
            while(s < k){
                long long int lower = find_lower(root, s);
                if(lower == 0){
                    result = -1;
                    break;
                }
                fishes.push_back(lower);
                root = deleteNode(root, lower);
                s += lower;
                result++;
            }
            cout<<result<<endl;
            while(fishes.size()>0){
                root = insert(root, fishes.back());
                fishes.pop_back();
            }
        }
        if(event == 2){
            long long int w;
            cin>>w;
            root = insert(root, w);
        }
        if(event == 3){
            long long int w;
            cin>>w;
            root = deleteNode(root, w);
        }
    }
    
    return 0;  
}