#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#include <cassert>
#include "souvenirs.h"
#include <utility>
#define SZ(x) (LL)(x.size())
#define FR(i,a,b) for(LL i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
typedef std::pair<LD,LD> PLD;
using namespace std;
const int MAXN=101;
int cnt[MAXN];
LL p[MAXN];
void buy_souvenirs(int n, LL p0){
p[0]=p0;
FR(i,1,n-1){
FOR(j,i){
if (j) transaction(p[i]);
else{
pair<vector<int>,LL> res=transaction(p[i-1]-1);
cnt[i]++;
if (SZ(res.A)==2) cnt[n-1]++;
if (SZ(res.A)==2 || res.B==1) p[i]=p[i-1]-2;
else p[i]=p[i-1]-1;
}
}
}
FOR(j,n-1-cnt[n-1]) transaction(p[n-2]-1);
}
