#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

typedef struct {
    int* categories;
    int size;
} CategoryHandler;

bool haveSameCategory(CategoryHandler* handler, int a, int b) {
    if (a < 0 || a >= handler->size || b < 0 || b >= handler->size) {
        return false;
    }
    return handler->categories[a] == handler->categories[b];
}

void dfs(int element, bool* visited, CategoryHandler* handler, int n) {
    visited[element] = true;
    for (int other = 0; other < n; other++) {
        if (!visited[other] && haveSameCategory(handler, element, other)) {
            dfs(other, visited, handler, n);
        }
    }
}

int solution(int n) {
    // For testing purposes, create a sample CategoryHandler
    CategoryHandler handler;
    handler.categories = (int*)malloc(n * sizeof(int));
    handler.size = n;
    for (int i = 0; i < n; i++) {
        handler.categories[i] = i % 3;
    }
    
    bool* visited = (bool*)calloc(n, sizeof(bool));
    int uniqueCategories = 0;
    
    for (int i = 0; i < n; i++) {
        if (!visited[i]) {
            dfs(i, visited, &handler, n);
            uniqueCategories++;
        }
    }
    
    free(visited);
    free(handler.categories);
    return uniqueCategories;
}

int main() {
    int n;
    scanf("%d", &n);
    printf("%d\n", solution(n));
    return 0;
}