2^k teams participate in a playoff tournament. The tournament consists of 2^k - 1 games. They are held as follows: first of all, the teams are split into pairs: team 1 plays against team 2, team 3 plays against team 4 (exactly in this order), and so on (so, 2^{k-1} games are played in that phase). When a team loses a game, it is eliminated, and each game results in elimination of one team (there are no ties). After that, only 2^{k-1} teams remain. If only one team remains, it is declared the champion; otherwise, 2^{k-2} games are played: in the first one of them, the winner of the game "1 vs 2" plays against the winner of the game "3 vs 4", then the winner of the game "5 vs 6" plays against the winner of the game "7 vs 8", and so on. This process repeats until only one team remains.

For example, this picture describes the chronological order of games with k = 3:

<image>

Let the string s consisting of 2^k - 1 characters describe the results of the games in chronological order as follows:

  * if s_i is 0, then the team with lower index wins the i-th game; 
  * if s_i is 1, then the team with greater index wins the i-th game; 
  * if s_i is ?, then the result of the i-th game is unknown (any team could win this game). 



Let f(s) be the number of possible winners of the tournament described by the string s. A team i is a possible winner of the tournament if it is possible to replace every ? with either 1 or 0 in such a way that team i is the champion.

You are given the initial state of the string s. You have to process q queries of the following form: 

  * p c — replace s_p with character c, and print f(s) as the result of the query. 

Input

The first line contains one integer k (1 ≤ k ≤ 18).

The second line contains a string consisting of 2^k - 1 characters — the initial state of the string s. Each character is either ?, 0, or 1.

The third line contains one integer q (1 ≤ q ≤ 2 ⋅ 10^5) — the number of queries.

Then q lines follow, the i-th line contains an integer p and a character c (1 ≤ p ≤ 2^k - 1; c is either ?, 0, or 1), describing the i-th query.

Output

For each query, print one integer — f(s).

Example

Input


3
0110?11
6
5 1
6 ?
7 ?
1 ?
5 ?
1 1


Output


1
2
3
3
5
4
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DPlayoffTournament solver = new DPlayoffTournament();
        solver.solve(1, in, out);
        out.close();
    }

    static class DPlayoffTournament {
        int k;
        StringBuilder sb;

        public void readInput(Scanner sc) {
            k = sc.nextInt();
            sb = new StringBuilder(sc.next());
        }

        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int tc = 1;
            while (tc-- > 0) {
                readInput(sc);
                char[] temp = new char[sb.length() + 1];
                for (int i = 1; i <= sb.length(); i++)
                    temp[i] = sb.charAt(i - 1);
                SegmentTree st = new SegmentTree(temp, 1 << (k - 1));
                int q = sc.nextInt();
                while (q-- > 0) {
                    int req = sc.nextInt();
                    st.array[req] = sc.next().charAt(0);
                    req = (1 << k) - req;
                    int bit = 0;
                    for (int i = 30; i >= 0; i--)
                        if ((req & 1 << i) != 0) {
                            bit = i;
                            break;
                        }
                    st.update_range(1, req, bit - 1);
                    pw.println(st.sTree[1]);
                }
            }
        }

        public class SegmentTree {
            int N;
            char[] array;
            int[] sTree;

            SegmentTree(char[] in, int N) {
                array = in;
                this.N = N;
                sTree = new int[N << 1];        //no. of nodes = 2*N - 1, we add one to cross out index zero
                build(1, 1, N);
            }

            void build(int node, int b, int e) {
                if (b == e)
                    sTree[node] = array[(1 << k) - node] == '?' ? 2 : 1;
                else {
                    int mid = b + e >> 1;
                    build(node << 1, b, mid);
                    build(node << 1 | 1, mid + 1, e);
                    sTree[node] = array[(1 << k) - node] == '?' ? sTree[node << 1] + sTree[node << 1 | 1] : array[(1 << k) - node] == '1' ? sTree[node << 1] : sTree[node << 1 | 1];
                }
            }

            void update_range(int node, int req, int bit) {
                if (req == node) {
                    int temp = (1 << k) - node;
                    if (temp <= 1 << (k - 1))
                        sTree[node] = array[(1 << k) - node] == '?' ? 2 : 1;
                    else
                        sTree[node] = array[(1 << k) - node] == '?' ? sTree[node << 1] + sTree[node << 1 | 1] : array[(1 << k) - node] == '1' ? sTree[node << 1] : sTree[node << 1 | 1];
                    return;
                }
                if ((req & (1 << bit)) == 0)
                    update_range(node << 1, req, bit - 1);
                else
                    update_range(node << 1 | 1, req, bit - 1);
                sTree[node] = array[(1 << k) - node] == '?' ? sTree[node << 1] + sTree[node << 1 | 1] : array[(1 << k) - node] == '1' ? sTree[node << 1] : sTree[node << 1 | 1];
            }

        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            try {
                while (st == null || !st.hasMoreTokens())
                    st = new StringTokenizer(br.readLine());
                return st.nextToken();
            } catch (Exception e) {
                throw new RuntimeException(e);
            }
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

