Problem:
Score : 100 points

Problem Statement

Takahashi is going to set a 3-character password.

How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Constraints

1 \leq N \leq 9

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of possible passwords.

Sample Input 1

2

Sample Output 1

8

There are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.

Sample Input 2

1

Sample Output 2

1

There is only one possible password if you can only use one kind of character.

Solution in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;

namespace abc140_e
{
    class Program
    {
        static void Main(string[] args)
        {
            var n = int.Parse(Console.ReadLine());
            var pList = Console.ReadLine().Split(' ').Select(int.Parse).ToList();
            var secondMeme = new Dictionary<Tuple<int, int>, int>();

            var sum = 0;
            foreach (var l in GetRange(0, n - 1))
            {
                foreach (var r in GetRange(l + 1, n))
                {
                    var xlr = GetSecond(pList, l, r);
                    sum += xlr;
                }
            }

            Console.WriteLine(sum);
        }

        static int GetSecond(List<int> list, int l, int r)
        {
            var subList = list.GetRange(l, r - l + 1);
            subList.Sort();
            subList.Reverse();
            var count = 0;
            var max2 = -10;

            

            return max2;
        }

        private static IEnumerable<int> GetRange(int from, int until)
        {
            return Enumerable.Range(from, until - from);
        }
    }
}