Luba And The Ticket(深搜解决的方法)

Luba has a ticket consisting of 6 digits. In one move she can choose digit in any position and replace it with arbitrary digit. She wants to know the minimum number of digits she needs to replace in order to make the ticket lucky.

The ticket is considered lucky if the sum of first three digits equals to the sum of last three digits.

Input

You are given a string consisting of 6 characters (all characters are digits from 0 to 9) — this string denotes Luba's ticket. The ticket can start with the digit 0.

Output

Print one number — the minimum possible number of digits Luba needs to replace to make the ticket lucky.

Examples

Input

000000

Output

0

Input

123456

Output

2

Input

111000

Output

1

Note

In the first example the ticket is already lucky, so the answer is 0.

In the second example Luba can replace 4 and 5 with zeroes, and the ticket will become lucky. It's easy to see that at least two replacements are required.

In the third example Luba can replace any zero with 3. It's easy to see that at least one replacement is required.

题意：给出一个六位数的的数字字符串，问最少改动多少个数字才能使前三位的和等于后三位的和。

深度搜索的思路，具体见代码

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <bits/stdc++.h>
#define LL long long
using namespace std;
char s[7];
int a[7];
int ans=100;
void dfs(int t,int b)//第t次，第b位
{
    if(a[1]+a[2]+a[3]==a[4]+a[5]+a[6]){//如果当前的数字符合，记录改变的最小的改变数
        ans=min(ans,t);
    }
    if(t>6||b>6) return ;//搜索边界
    for(int i=0;i<=9;i++){//每一位数都对0～9的所有数字进行搜索
        if(i!=a[b]){
            int temp=a[b];
            a[b]=i;
            dfs(t+1,b+1);
            a[b]=temp;
            }
            else {
                dfs(t,b+1);
            }
    }
    return ;
}
int main()
{
    scanf("%s",s+1);
    int sum1=0,sum2=0;
    for(int i=1;i<=6;i++){
        a[i]=s[i]-'0';
        if(i<=3){
            sum1+=a[i];
        }
        else{
            sum2+=a[i];
        }
    }
    if(sum1==sum2){
        printf("0\n");
    }
    else {
            dfs(0,1);
            printf("%d\n",ans);
    }
    return 0;
}