#include using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) typedef vector VI; typedef vector VVI; typedef vector VL; typedef vector VVL; typedef long long LL; #define all(a) (a).begin(), (a).end() #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl #define YES(n) cout << ((n) ? "YES" : "NO" ) << endl #define ALL(a) (a).begin(),(a).end() #define pb push_back LL maxx=LL(1000000000)*1000000000; LL wa(LL a,LL b){ if(a>=maxx-b){return maxx;} return a+b; } LL seki(LL a,LL b){ if(b==0){return 0;} if(a>=maxx/b){return maxx;} return a*b; } LL g(LL a,LL b,LL c,LL t){ LL k=t/b; LL p=wa(a,seki(k,c)); LL ans=seki(p,t-k*b); ans=wa(ans,seki(a,seki(k,b))); p=seki(k,k-1)/2; p=seki(p,b); p=seki(p,c); ans=wa(ans,p); return ans; } LL f(LL n,LL a,LL b,LL c){ LL l=0,r=n,t; while(r-l>1){ //cout<>n>>a>>b>>c>>d>>e>>ff; LL p=f(n,a,b,c),q=f(n,d,e,ff); if(p==q){cout<<"Same"<