Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Polyline

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere are three points marked on the coordinate plane. The goal is to make a simple polyline, without self-intersections and self-touches, such that it passes through all these points. Also, the polyline must consist of only segments parallel to the coordinate axes. You are to find the minimum number of segments this polyline may consist of.

Input

Each of the three lines of the input contains two integers. The *i*-th line contains integers *x*_{i} and *y*_{i} ( - 10^{9} ≤ *x*_{i}, *y*_{i} ≤ 10^{9}) — the coordinates of the *i*-th point. It is guaranteed that all points are distinct.

Output

Print a single number — the minimum possible number of segments of the polyline.

Examples

Input

1 -1

1 1

1 2

Output

1

Input

-1 -1

-1 3

4 3

Output

2

Input

1 1

2 3

3 2

Output

3

Note

The variant of the polyline in the first sample: The variant of the polyline in the second sample: The variant of the polyline in the third sample:

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/22/2022 14:58:19 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|