[Timus] 1293 Eniya

Problem statement is here: http://acm.timus.ru/problem.aspx?space=1&num=1293

Another easy problem. Do as the problem asks you to do.

package codes;

import FastIO.InputReader;
import FastIO.OutputWriter;

public class Task1293 {
    public void solve(int testNumber, InputReader in, OutputWriter out) {
        int n = in.nextInt();
        int a = in.nextInt();
        int b = in.nextInt();

        out.println(n*a*b*2);
    }
}