Test case 1,2 and 3 not passing

#include<bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define ss second
#define ff first
#define pll pair<ll,ll>
#define vll vector
#define mll map<ll,ll>
#define mod 1000000007
#define w(x) ll x; cin>>x; while(x–)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) for (ll i=j ; i<k ; i+=in)
#define re(i, j) fo(i, 0, j, 1)
#define pi 3.1415926535897932384626433832795
#define all(cont) cont.begin(), cont.end()
#define countbit(x) __builtin_popcount(x)
#define mod 1000000007
#define lo lower_bound
#define de(n) ll n;cin>>n;
#define def(a,n) ll n;cin>>n;ll a[n];re(i,n){cin>>a[i];}
#define defi(a,n,k) ll n;cin>>n; ll k;cin>>k;ll a[n];re(i,n){cin>>a[i];}
#define deb(x) cout<<#x<<"="<<x<<endl;
#define tr(it,a) for(auto it=a.begin();it!=a.end();it++)
#define nl cout<<endl;
using namespace std;
//182D
int main()
{
//cp();
ll q;
cin>>q;
stack s;
while(q–)
{
ll n;
cin>>n;
if(n==1)
{
if(s.empty()==false)
{
cout<<s.top();
nl;
s.pop();
}
}
else
{
ll k;
cin>>k;
s.push(k);
}
}
//cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << “ms\n”;
}

hello @mishranavneet1710
u havent handled this case->
image