import math
(y, b, r) = map(int, input().split())
sum = 0
z = min(y, b, r)
if(z == y):
x = min(b , r)
if (x == r and r < y +2):
sum += 3*x - 3
elif (z == b):
sum += 3*z
else:
sum += 3*z + 3
elif (z == b):
if (z == r):
sum += (3*z)-3
else:
sum += 3*z
else:
sum += (3*z)-3
print(sum)
#include <iostream>
using namespace std;
int main() {
int y, b, r;
cin >> y >> b >> r;
// choose the maximum number of blue ornaments
b = min(b, y+1);
b = min(b, r-1);
// adjust yellow and red ornaments accordingly
y = b-1;
r = b+1;
// calculate the total number of ornaments
int total = y + b + r;
cout << total << endl;
return 0;
}
732B - Cormen --- The Best Friend Of a Man | 1369A - FashionabLee |
1474B - Different Divisors | 1632B - Roof Construction |
388A - Fox and Box Accumulation | 451A - Game With Sticks |
768A - Oath of the Night's Watch | 156C - Cipher |
545D - Queue | 459B - Pashmak and Flowers |
1538A - Stone Game | 1454C - Sequence Transformation |
165B - Burning Midnight Oil | 17A - Noldbach problem |
1350A - Orac and Factors | 1373A - Donut Shops |
26A - Almost Prime | 1656E - Equal Tree Sums |
1656B - Subtract Operation | 1656A - Good Pairs |
1367A - Short Substrings | 87A - Trains |
664A - Complicated GCD | 1635D - Infinite Set |
1462A - Favorite Sequence | 1445B - Elimination |
1656C - Make Equal With Mod | 567A - Lineland Mail |
1553A - Digits Sum | 1359B - New Theatre Square |