#include #include #include #include #include #include #include #include using namespace std; int main (void) { string S; cin >> S; long long bestBelow = 0; long long bestAbove = 100; int n = S.length(); for (int i = 0; i < n; i++) { int d = S[i] - '0'; long long newBestBelow = min( min( bestBelow + d , bestBelow + 11 - d ), min( bestAbove + d + 1, bestAbove + 10 - d )); long long newBestAbove = min( min( bestBelow + d + 1, bestBelow + 10 - d ), min( bestAbove + d + 2, bestAbove + 9 - d )); bestBelow = newBestBelow; bestAbove = newBestAbove; } cout << min(bestBelow, bestAbove+1) << "\n"; return 0; }