import static java.util.Objects.requireNonNull;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public final class Main {
public static final String IN_FILE = "dfs.in";
public static final String OUT_FILE = "dfs.out";
public static final class FastScanner implements AutoCloseable {
private final BufferedReader reader;
private StringTokenizer tokenizer;
public FastScanner(final String fileName) throws IOException {
reader = new BufferedReader(
new InputStreamReader(new FileInputStream(fileName)));
}
private String next() throws IOException {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
final String line = requireNonNull(reader.readLine());
tokenizer = new StringTokenizer(line);
}
return tokenizer.nextToken();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
@Override
public void close() throws IOException {
reader.close();
}
}
public static void dfs(
final int[][] graph, final int u, final boolean[] visited) {
visited[u] = true;
for (final int v : graph[u]) {
if (!visited[v]) {
dfs(graph, v, visited);
}
}
}
public static int countComponents(final int[][] graph) {
final boolean[] visited = new boolean[graph.length];
int components = 0;
for (int u = 0; u < graph.length; u++) {
if (!visited[u]) {
components++;
dfs(graph, u, visited);
}
}
return components;
}
public static int[][] readGraph(final FastScanner scanner)
throws IOException {
final int size = scanner.nextInt();
final int[][] edges = new int[scanner.nextInt()][];
final int[] degrees = new int[size];
for (int e = 0; e < edges.length; e++) {
final int u = scanner.nextInt() - 1;
final int v = scanner.nextInt() - 1;
edges[e] = new int[] {u, v};
degrees[u]++;
degrees[v]++;
}
final int[][] graph = new int[size][];
for (int u = 0; u < size; u++) {
graph[u] = new int[degrees[u]];
}
for (int e = 0; e < edges.length; e++) {
final int u = edges[e][0];
final int v = edges[e][1];
graph[u][degrees[u] - 1] = v;
graph[v][degrees[v] - 1] = u;
degrees[u]--;
degrees[v]--;
}
return graph;
}
public static void main(final String[] args) throws IOException {
try (final FastScanner scanner = new FastScanner(IN_FILE);
final PrintWriter writer = new PrintWriter(OUT_FILE)) {
final int[][] graph = readGraph(scanner);
final int components = countComponents(graph);
writer.println(components);
}
}
}