Implement a Queue using 2 stacks** s1** and** s2** .

**Input **(To be used for **Expected Output**)**:**

The first line of the input contains an integer '**T**' denoting the number of test cases. Then T test cases follow.

First line of each test case contains an integer **Q** denoting the number of queries .

A Query **Q** is of 2 Types

**(i)** 1 x (a query of this type means pushing **'x'** into the queue)

**(ii)** 2 (a query of this type means to pop element from queue and print the poped element)

The second line of each test case contains** Q** queries seperated by space.

**Output:**

The output for each test case will be space separated integers having **-1** if the queue is empty else the element poped out from the queue .

You are required to complete the two methods **push** which take one argument an integer **'x'** to be pushed into the quee and **pop** which returns a integer poped out from othe queue.

**Constraints:**

1<=**T**<=100

1<=**Q**<=100

1<=**x**<=100

**Example:
Input**

1

5

1 2 1 3 2 1 4 2

2 3

In the first test case for query

1 2 the quee will be {2}

1 3 the queue will be {2 3}

2 poped element will be 2 the queue will be {3}

1 4 the queue will be {3 4}

2 poped element will be 3

Note:The

All Is Well | 176 |

Srinivas Chakravarth | 142 |

ioan | 131 |

praveen2809 | 116 |

Diplav Srivastava | 105 |

Lam Ngoc Pham | 405 |

All Is Well | 365 |

Divvya Sinha | 356 |

skull tone | 310 |

Prateek Gole | 309 |

akhayrutdinov | 3805 |

sanjay05 | 3366 |

Michael Riegger | 2014 |

Jasleen Kaur 2 | 2012 |

Quandray | 1933 |