Magnets

Magnets

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.

问题链接：https://vjudge.net/problem/CodeForces-344A

题意分析：输入正整数n,  表示有n个磁铁,  然后n行表示磁铁的状态,  01表示正-负,10表示负-正,  正负相吸,正正或负负相斥, 输出可以形成多少组磁铁.    定义一个数组,存放磁铁的摆放状态,遍历数组,若i与i+1-th磁铁状态不相同,则说明磁铁没有相吸,(counter++),最后输出counter即可.

AC代码：

#include<iostream>
#include<cstring>
using namespace std;
int main()
{
	int n, k = 0;
	int a[200005];
	cin >> n;
	for(int i=0;i<n;i++)
	{
		cin >> a[i];
	}
	for(int i=0;i<n;i++)
	{
		if (a[i] != a[i + 1])k++;
	}
	cout << k;
}