Problem:
Score : 100 points

Problem Statement

You are given an integer N that has exactly four digits in base ten.
How many times does 2 occur in the base-ten representation of N?

Constraints

1000 \leq N \leq 9999

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer.

Sample Input 1

1222

Sample Output 1

3

2 occurs three times in 1222. By the way, this contest is held on December 22 (JST).

Sample Input 2

3456

Sample Output 2

0

Sample Input 3

9592

Sample Output 3

1

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(void)
{
	int n,a[100001],i,max=0,smax=0,flag=0;
	scanf("%d",&n);
	
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
		if(a[i]>max){
			smax=max;
			max=a[i];
		} else if(a[i]>smax) {
			smax=a[i];
		}
	}
	
	if(max%2==0)flag=1;
	if(max-smax==1)flag=0;
	
	if(flag==0) printf("first\n");
	else printf("second\n");

	
	return 0;
}