CodeForces - 344A. Magnets

A. Magnets

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn't need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a "plus") and negative (a "minus"). If two magnets are put together at a close distance, then the like poles will repel each other and the opposite poles will attract each other.

Mike starts by laying one magnet horizontally on the table. During each following step Mike adds one more magnet horizontally to the right end of the row. Depending on how Mike puts the magnet on the table, it is either attracted to the previous one (forming a group of multiple magnets linked together) or repelled by it (then Mike lays this magnet at some distance to the right from the previous one). We assume that a sole magnet not linked to others forms a group of its own.

Mike arranged multiple magnets in a row. Determine the number of groups that the magnets formed.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 100000) — the number of magnets. Then n lines follow. The i-th line (1 ≤ i ≤ n) contains either characters "01", if Mike put the i-th magnet in the "plus-minus" position, or characters "10", if Mike put the magnet in the "minus-plus" position.

Output

On the single line of the output print the number of groups of magnets.

Examples

input

6
10
10
10
01
10
10

output

3

input

4
01
01
10
10

output

2

Note

The first testcase corresponds to the figure. The testcase has three groups consisting of three, one and two magnets.

The second testcase has two groups, each consisting of two magnets.

题意：有很多的小磁铁，正负极分别用“+”和“--"表示，磁铁有着”异性相吸，同性相斥“的特点，如果两块小磁铁相互吸引，那么就可以将其看成一块大磁铁，现在给出所有小磁铁的正负极朝向，问最终会形成多少块大磁铁。

只需要在输入的同时判断是否与上一块磁铁的朝向相同，如果相同就不作处理继续输入，如果不同择计数器加1。

#include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int n,sum=1,k=0;
    char s[100008][4];
    scanf("%d",&n);
    n--;
    scanf("%s",s[k]);
    while(n--)
    {
        k++;
        scanf("%s",s[k]);
        if(s[k][0]==s[k-1][1])
            sum++;
    }
    printf("%d\n",sum);
    return 0;
}