import java.util.Scanner;
public class a216 {
public static void main(String[] args) {
/*
型態必用長整數,不然會出錯
*/
Scanner input = new Scanner(System.in);
while (input.hasNext()){
long n = input.nextLong();
System.out.println(f(n) + " " + g(n));
}
input.close();
}
public static long f(long n){
if (n == 1)
return 1;
else
return n + f(n - 1);
}
public static long g(long n){
return n * (n+1) * (n+2) / 6; //此處為大神整理公式,可有效節省記憶體
}
}