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

int numSquares(int n) {
    if (n <= 0) return 0;
    
    // Generate perfect squares up to n
    int squares[100];  // Assuming sqrt(n) <= 100
    int squareCount = 0;
    for (int i = 1; i * i <= n; i++) {
        squares[squareCount++] = i * i;
    }
    
    // BFS using arrays (simplified)
    bool visited[n + 1];
    for (int i = 0; i <= n; i++) visited[i] = false;
    
    int queue[n + 1];
    int front = 0, rear = 0;
    queue[rear++] = 0;
    visited[0] = true;
    int level = 0;
    
    while (front < rear) {
        level++;
        int size = rear - front;
        
        for (int i = 0; i < size; i++) {
            int current = queue[front++];
            
            for (int j = 0; j < squareCount; j++) {
                int nextVal = current + squares[j];
                if (nextVal == n) {
                    return level;
                }
                if (nextVal < n && !visited[nextVal]) {
                    visited[nextVal] = true;
                    queue[rear++] = nextVal;
                }
            }
        }
    }
    
    return level;
}

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