#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair; using vb=vector;using vs=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; templateT read(){T t;cin>>t;return t;} templateostream&operator<<(ostream&o,const pair&p){o<<'('<(); int Q = read(); random_device rnd; const ll base = (ll)(mod * ((rnd() + 1.0) / bit(32))) % mod; map first; ll current = 0; first[0] = 0; rep(q, Q) { char t = read(); if (t == '!') { int l = read(); int r = read(); int k = read(); ll sl = gpSumMod(k, base, l); ll sr = gpSumMod(-k, base, r); current += sl; current += sr; current %= mod; if (first.count(current) == 0) { first[current] = q + 1; } } else { cout << first[current] << endl; } //cout << q << " : " << current << endl; } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }