#include using namespace std; #define F first #define S second #define ER erase #define IS insert #define PI acos(-1) #define PB pop_back #define MP make_pair #define MT make_tuple #define LB lower_bound #define UB upper_bound #define EB emplace_back #define lowbit(x) (x & -x) #define SZ(x) ((int)x.size()) #define ALL(x) x.begin(), x.end() #define RALL(x) x.rbegin(), x.rend() #define SOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);cout< VL; typedef vector VI; typedef vector VB; typedef pair PLL; typedef vector VS; typedef vector VD; typedef pair PII; typedef unsigned long long ULL; typedef pair PDD; typedef tuple TIII; typedef vector > VPLL; typedef vector > VPII; template using VE = vector; template using USET = unordered_set; template using HEAP = priority_queue; template using PA = pair; template using UMAP = unordered_map; template using RHEAP = priority_queue, greater >; template A MAX(const A &a) { return a; } template A MIN(const A &a) { return a; } template A MAX(const A *a, const A *b) { return *max_element(a, b); } template A MIN(const A *a, const A *b) { return *min_element(a, b); } template A MAX(const A &a, const B&... b) { return max(a, MAX(b...)); } template A MIN(const A &a, const B&... b) { return min(a, MIN(b...)); } template ::value_type> B MAX(A a, A b) { return *max_element(a, b); } template ::value_type> B MIN(A a, A b) { return *min_element(a, b); } int main(){ SOS; string s; cin>>s; int size=s.size(); int ans=0; for(int i=0;i