import java.math.BigInteger;

public class Euler113 {
    static BigInteger comb(int n, int k) {
        BigInteger r = BigInteger.ONE;
        for (int i = 1; i <= k; i++) r = r.multiply(BigInteger.valueOf(n-k+i)).divide(BigInteger.valueOf(i));
        return r;
    }
    public static void main(String[] args) {
        int n = 100;
        BigInteger inc = comb(n+9,9).subtract(BigInteger.ONE);
        BigInteger dec = comb(n+10,10).subtract(BigInteger.valueOf(n+1));
        BigInteger flat = BigInteger.valueOf(9L*n);
        System.out.println(inc.add(dec).subtract(flat));
    }
}