Count Sixes

Background

Congcong is learning array operations. Dawei assigned him a task to count the occurrences of a specific pattern in an array.

Problem Description

Given an array of integers, return the number of times that two $6$'s are next to each other in the array. Also count instances where the first number is $6$ and the second number is $7$.

Input Format

Input is given from Standard Input in the following format.

A single line containing space-separated integers, representing the elements of the array.

Output Format

Output is printed to Standard Output in the following format.

A single integer, the total count.

Sample

[6 6 2]

1

[6 6 2 6]

1

[6 7 2 6]

1

Sample Explanation

Sample 1: The array is [6, 6, 2]. At indices $0$ and $1$, the numbers $6$ and $6$ are adjacent, which satisfies the condition. The count is $1$. Sample 2: The array is [6, 6, 2, 6]. At indices $0$ and $1$, the numbers $6$ and $6$ are adjacent, which satisfies the condition. The count is $1$. Sample 3: The array is [6, 7, 2, 6]. At indices $0$ and $1$, the numbers $6$ and $7$ are adjacent, which satisfies the condition. The count is $1$.

Constraints

Time limit: 1 second, Memory limit: 1024 KB.