import java.util.Scanner;
import java.util.List;
import java.io.IOException;
import java.util.Arrays;
import java.util.Set;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.TreeSet;
import java.util.LinkedList;
import java.util.HashSet;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskE solver = new TaskE();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskE {

    class Vertex implements Comparable<Vertex> {
        long dist;
        int v;

        public Vertex(long  dist, int v) {
            this.dist = dist;
            this.v = v;
        }

        public int compareTo(Vertex o) {
//            if (dist == o.dist) return Integer.compare(v, o.v);

            return Long.compare(dist, o.dist);
        }
    }

    public void solve(int testNumber, Scanner in, PrintWriter out) {
        TreeSet<Vertex> q = new TreeSet<Vertex>();
        q.add(new Vertex(0, 1));    
        q.add(new Vertex(0, 2));    
        out.println(q.size());
    }
}