#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define F first
#define S second
#define pii pair<int,int> 
#define all(a) a.begin(),a.end()
int bp(int x, int n){
	int res = 1;
	while(n){
		if(n&1) res = res * x;
		x *= x; n >>= 1;
	}
	return res;
}
void solve(){
	int n; cin >> n;
	for(int i = 1; bp(3,i) <= n; i++){
		int x = bp(3,i);
		for(int j = 1; bp(5,j) <= n; j++){
			int y = bp(5,j);
			if(x + y == n){
				cout << i << ' ' << j;
				return ;
			}
		}
	}
	cout << -1;
}
int32_t main(){
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);freopen("answer.txt", "w", stdout);
	#endif 
    int t = 1; 
    //cin >> t;
    while(t--){
        solve();
    }    
}

//#include "bits/stdc++.h"

#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <array>
#include <unordered_map>
#include<unordered_set>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iterator>
#include<iomanip>
#include<complex>
#include<fstream>
#include<assert.h>

#include<stdio.h>

using namespace std;

#define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)

#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, double> pid;
typedef pair<double, int> pdi;
typedef pair<double, double> pdd;
typedef vector< vector<int> > mat;

template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;

const double EPS = 1e-16;

signed main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;

	vector<pii> F(N);
	rep(i, 0, N)
	{
		cin >> F[i].first >> F[i].second;
	}

	int add = 0;
	int UP = INF, DOWN = -INF;
	int cons = INF;

	rrep(i, 0, N)
	{
		if (F[i].second == 1)
		{
			UP -= F[i].first;
			DOWN -= F[i].first;
			add += F[i].first;
		}
		if (F[i].second == 2)
		{
			chmax(DOWN, F[i].first);
			if (UP <= DOWN)
			{
				cons = UP + add;
				break;
			}
		}
		if (F[i].second == 3)
		{
			chmin(UP, F[i].first);
			if (UP <= DOWN)
			{
				cons = DOWN + add;
				break;
			}
		}
	}

	int Q;
	cin >> Q;

	rep(i, 0, Q)
	{
		int x;
		cin >> x;
		if (cons != INF)
		{
			cout << cons << endl;
		}
		else
		{
			cout << min(UP, max(DOWN, x)) + add << endl;
		}
	}
	
	return 0;
}