CODE FESTIVAL 2016 is going to be held. For the occasion, Mr. Takahashi decided to make a signboard.

He intended to write `CODEFESTIVAL2016` on it, but he mistakenly wrote a different string S. Fortunately, the string he wrote was the correct length.

So Mr. Takahashi decided to perform an operation that replaces a certain character with another in the minimum number of iterations, changing the string to `CODEFESTIVAL2016`.

Find the minimum number of iterations for the rewrite operation.

Constraints

* S is 16 characters long.
* S consists of uppercase and lowercase alphabet letters and numerals.

Input

Inputs are provided from Standard Input in the following form.


S


Output

Output an integer representing the minimum number of iterations needed for the rewrite operation.

Examples

Input

C0DEFESTIVAL2O16


Output

2


Input

FESTIVAL2016CODE


Output

16
import java.util.*;

public class Main{
    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	String S = sc.next();
	int cnt = 0;
	String T = "CODEFESTIVAL2016";
	for ( int i = 0; i < S.length(); i++ ) {
	    if ( S.charAt(i) != T.charAt(i) ) cnt++;
	}
	System.out.println(cnt);
    }
}
