Bitwise for Dummies
This is to provide you with an introductory experience of bit-wise ope...
Max. Marks: 6
Solved By : 188
Double the Number
Given an array A of size N and K. count all the number of elements suc...
Max. Marks: 8
Solved By : 289
Rotate Array
You are given an array of N length. You have to rotate the array right...
Max. Marks: 6
Solved By : 1617
Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 5128
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 4216
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 2376
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 3662
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 4348
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2996
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 2255
Stack! Stack! Stack!
Please select a challenge
Problem Statement
Practice your stack data structure. You will be given a series of tasks of push, pop, peek operations to perform on a stack. You need to print the sum of the final stack.

First line contains Q, the number of queries. The next Q lines each contain a query. PUSH queries are accompanied by a positive number N.

Print the topmost element for every 'PEEK' query, each in a newline. Also, print the sum of the remaining elements of the stack in the end in a newline.

1 ≤ Q ≤ 50 1 ≤ N ≤ 1000 It is guaranteed that there would be no query of pop or peek operation on an empty stack.

Sample Input

Sample Output


Dcoded By: Mrudul Sankhere

Solved By: 457

Maximum Marks: 9