#ifdef LOCAL
#pragma warning(disable:4996)
#pragma warning(disable:4244)
#pragma warning(disable:4554)
#define gets gets_s

#endif
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<string>
#include<cctype>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<bitset>
#include<assert.h>
#include<unordered_map>
#include<ctime>
#define ll long long
#define cl(a,x) memset((a),(x),sizeof(a))
#define lson 2*i
#define rson 2*i+1
#define sf scanf
#define ull unsigned long long
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define ti tree[i]
#define mp make_pair
#define debug cerr <<"flag" << endl;
ll q_pow(ll x, ll n, ll mod) { ll ret = 1; while (n) { if (n & 1) ret = x * ret%mod; x = x * x%mod; n >>= 1; }return ret; }
ll __gcd(ll x, ll y) { if (!y) return x; return __gcd(y, x%y); }
ll getbit(ll now) { int cnt = 0; while (now) { cnt++; now -= lowbit(now); }return cnt; }
int dx[] = { -1,1,0,0 };//上下左右
int dy[] = { 0,0,-1,1 };//
using namespace std;
const ll maxn = 2e5 + 10;
const ll INF = 0x3f3f3f3f;
const ll IINF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
const int mod = 1e9 + 7;

int dp[maxn];
char s[maxn];

void solve() {
	sf("%s", s + 1);
	int n = strlen(s + 1);

	int cnt = n;
	ll ans = 0;
	int last = -INF;
	for (int i = 1; i <= n; i++) {
		if (s[i] == s[i + 1] and s[i] != s[i + 2] and last != s[i]) {
			if (last != s[i]) ans += n - i, last = s[i];
		}
		else if (last == s[i]) ans--;
	}

	printf("%lld\n", ans);
}

signed main(int argc, char *argv[]) {
	if (argc == 2 && strcmp("-debug", argv[1]) == 0) {
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	}

	int t = 1;
	///cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}

#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
signed main(){
   fastio ;
   int n ;
   cin >> n ; 
   vector<int> v ;
   for(int i  = 0 ; i < 61 ; i++){
   	    v.pb(1LL << i);
   }
   //for(auto x : v) cout << x << endl;
   int ans = 1e18;
   for(auto x : v){
   	   int b = x ;
   	   int c = n%b ;
   	   int a = (n - c)/b ;
   	   ans = min(ans , a + (int)log2(b) + c);
   }
   cout << ans ; 
}

