// 1 HARMONIE
import java.lang.Math;
public class coma1
{
    public static void main(String[] args){
        bereken(4*Math.PI);
    }
    
    public static void bereken(double k){
        int i = 1;
        double sum = 1;
        while(sum<k){
            i++;
            sum = sum + 1.0/i;
        }
        System.out.println(i);
    }
}

// 2 GEMENE VEELVOUDEN
public class coma2
{
	public static void main(String[] args)
	{
		long n=1;
		for(long i=1;i<=22;i++){
			n=n*2;
		}
		boolean[] prime= new boolean[(int)n-1];		
		for(long i=2;i*i<=n;i++){
			if(!prime[(int)i-2]){
				for(long j=2;j*i<=n;j++){
					prime[(int)(i*j)-2]=true;
				}
			}
		}
		long i,j,q;
		i=0;
		for(long p=2;p<=n;p++){
			if(!prime[(int)p-2]){
				q=p;
				j=0;
				while(q<=n){
					q=q*p;
					j++;
				}
				i=i+j;
			}
		}
		
		j=0;
		for(long p=2;p<=n;p++){
			if(!prime[(int)p-2]){
				
				j++;
			}
		}
		System.out.println(i);
	}
}

// 3 IS ER MEER TE ZIEN DAN BLABLA
public class coma3
{
    public static void main(String[] args){
        long i = 1L;
        int fibo1 = 0;
        int fibo2 = 1;
        
        while(i<5040302009L){
            fibo1 = (fibo1+fibo2)%139;
            i++;
            if(i==5040302009L)
                System.out.println(-1+fibo1);
            fibo2 = (fibo1+fibo2)%139;
            i++;
            if(i==5040302009L)
               System.out.println(-1+fibo2);
         }
    }
}

// 4 SCHEVE TOREN

import java.math.*;
public class coma4
{
	public static void main(String[] args)
	{
		BigInteger p= new BigInteger("4900");
		BigInteger q= new BigInteger("4900");
		for(int i=1;i<=49;i++){
			p=new BigInteger(p.pow(49).toString().substring(0,88));
			q=new BigInteger(q.pow(49).toString().substring(0,88));
			q=q.add(new BigInteger("1"));
		}
		System.out.println(p.toString().substring(0,10));
		System.out.println(q.toString().substring(0,10));
	}

}



// 5 PUNTEN TELLEN
import java.util.ArrayList;
import java.lang.Integer;
import java.lang.Math;
public class coma5
{
    public static void main(String[] args){
        ArrayList L = calc(250);
        System.out.println(L.toString());
    }
    
    public static ArrayList calc(int B){
        int[] primes = find_primes(B);
        int length=primes.length;
        ArrayList L = new ArrayList();
        for (int p=0; p<length; p++){
            if (tel_punten(primes[p]) == primes[p])
                L.add(new Integer(primes[p]%7));
        }
        return L;
    }
    
    public static int tel_punten(int p){
        int n=0;
        int value;
        for (int x=0; x<p; x++){
            for (int y=0; y<p; y++){
                value = (int)(7.0*Math.pow(((double)x),3.0) - 5.0*((double)x) + 2.0 - 2.0*Math.pow(((double)y),2.0))%p;
                if (0==value || p==value){
                    n += 1;
                }
            }
        }
        if(n==p)
            return n;
        else
            return -1;
    }
    
    public static int[] find_primes(int max)
    {
        int[] primes;
        int i,j,k, divisor, offset;
        
        double sqrt = Math.sqrt(max)+1;
        int tmp[];
        
        if(max  > 100)
        {
            primes = new int[max/2];
        }
        else
        {
            primes = new int[max];
        }
        primes[0] = 2;
        primes[1] = 3;
        
        for(i=2,j=5; j < max ; j+=2)
        {
            if(j % 3 != 0)
            {
                primes[i++] = j;
            }
        }
        
        for(i=2, divisor=5, offset = primes.length; divisor < sqrt ; )
        {
            j = i*i;
            tmp = new int[offset];
            offset = j;
            
            System.arraycopy(primes,0,tmp,0,j);
            while( j < tmp.length)
            {
                k = primes[j++];
                if(k==0)
                {
                    break;
                }
                if(k % divisor != 0)
                {
                    tmp[offset++] = k;
                }
            }
            primes = null;
            primes = tmp;
            tmp = null;
            divisor = primes[i++];
        }
        for(int z = 0; z<primes.length;z++)
            System.out.println(primes[z] + "\n");
        return primes;
    }
    
}

// 6

 = 1 + (1 + 1/2 + 1/3 + ... + 1/2010) / 2010