1073. Square Country

1073. Square Country

Time Limit: 1.0 second
Memory Limit: 16 MB

There live square people in a square country. Everything in this country is square also. Thus, the Square Parliament has passed a law about a land. According to the law each citizen of the country has a right to buy land. A land is sold in squares, surely. Moreover, a length of a square side must be a positive integer amount of meters. Buying a square of land with a side  aone pays  a ² quadrics (a local currency) and gets a square certificate of a landowner.

One citizen of the country has decided to invest all of his  N quadrics into the land. He can, surely, do it, buying square pieces 1 × 1 meters. At the same time the citizen has requested to minimize an amount of pieces he buys: "It will be easier for me to pay taxes," — he has said. He has bought the land successfully.

Your task is to find out a number of certificates he has gotten.

Input

The only line contains a positive integer  N ≤ 60 000 , that is a number of quadrics that the citizen has invested.

Output

The only line contains a number of certificates that he has gotten.

Sample

input	output
344	3

例如 12 = 2 * 2 + 2 * 2 + 2 * 2

#include <iostream>
#include <cmath>
using namespace std;


int main()
{
	int i, j;
	int f[60001];
	for (i=1; i<60001; i++)
		f[i] = 1000000;
	for (i=1; i*i<60001; i++)
		f[i*i] = 1;
	for (i=1; i<60001; i++)
		for (j=1; j*j<i; j++)
			f[i] = min(f[i], f[i-j*j]+1);
	while (cin>>i)
		cout<<f[i]<<endl;
}