Problem:
 Score : 100 points    Problem Statement It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2 .  Given an integer r , find the area of a regular dodecagon inscribed in a circle of radius r .      Constraints  1 \leq r \leq 100  r is an integer.         Input Input is given from Standard Input in the following format:  r       Output Print an integer representing the area of the regular dodecagon.        Sample Input 1 4      Sample Output 1 48  The area of the regular dodecagon is 3 \times 4^2 = 48 .       Sample Input 2 15      Sample Output 2 675       Sample Input 3 80      Sample Output 3 19200

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
import math
mod = 10**9 + 7
def I(): return int(input())
def II(): return map(int, input().split())
def L(): return list(map(int, input().split()))
def TWO(M):
  L=[0]*M
  R=[0]*M
  for i in range(M):
    L[i],R[i] = II()
  return L, R

r = I()
print(3*r**2)

Solution (Python):
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())


r = ni()

print(3 * r * r)

Solution (Python):

r = int(input())
print(3 * (r ** 2))

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
print(3 * int(input()) ** 2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())
print(3 * r **2)

Solution (Python):
r = int(input())

print(3 * (r)**2)

Solution (Python):

r = int(input())

print (3* (r**2))

Solution (Python):
r = int(input())

print(3 * r**2)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
from collections import defaultdict, deque
import sys

sys.setrecursionlimit(100000)

MIN = -10 ** 9
MAX = 10 ** 9 + 7


def main():
    N = int(input())
    

    print(3*N*N)


if __name__ == '__main__':
    main()

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())

print(3 * r**2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r = int(input())
print(r * r * 3)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
a=int(input())
print(3*a**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
import sys
input=sys.stdin.readline

a=int(input())
print(3*a*a)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
import sys

input = sys.stdin.readline

r = int(input().strip())
print(3 * r * r)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
n = int(input())

print(n ** 2 * 3)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):

n = int(input())
print(3*n*n)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):
n=int(input())

print(n*n*3)

Solution (Python):
r = int(input())

print(3 * r ** 2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r = int(input())

print(3 * r * r)

Solution (Python):
n = int(input())

print(3 * n * n)

Solution (Python):
a = int(input())
print(3*a*a)

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
print(3*(int(input()))**2)

Solution (Python):
def main():
    r = int(input())
    print(3 * r**2)


if __name__ == "__main__":
    main()

Solution (Python):


import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline 

print(3* int(input())**2)

Solution (Python):
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    r = int(input())

    print(3 * r * r)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

r = INT()

print(3*r**2)

Solution (Python):
r = int(input())

print(3 * r * r)

Solution (Python):
n = int(input())
print(3*n*n)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):


r = int(input())

print(3*r*r)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    r = i2n()
    print(3 * r * r)

main()

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
N=int(input())
print(3*N**2)

Solution (Python):
r = int(input())

print(3* (r**2))

Solution (Python):
r=int(input())
print(r*r*3)

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())

print(3 * r ** 2)

Solution (Python):

r = int(input())

print(3*r**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
n = int(input())
print((n**2)*3)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())

print(3 * r * r)

Solution (Python):
n = int(input())
print(3*n*n)

Solution (Python):
a = int(input())
print(3*(a**2))

Solution (Python):
N = int(input())
print(N*N*3)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
a=int(input())

print(3*a*a)

Solution (Python):
n = int(input())
print(3*(n**2))

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
N = int(input())
print(N**2*3)

Solution (Python):
r=int(input())

print(3*r**2)

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
a = int(input())
print(3 * a * a)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

def main():
    R = INT()
    print(3* R*R)

if __name__ == '__main__':
    main()

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())

print(3 * r * r)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())
s = r*r*3
print(s)

Solution (Python):

r = int(input())

print(3 * r ** 2)

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):
a = int(input())
print(str(3*a*a))

Solution (Python):
a = int(input())
print(3*a**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())


print(3*r**2)

Solution (Python):
R = int(input())
print(3*R*R)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):







N = int(input())






print(3*N**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
a = int(input())
print(3*a*a)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
a=int(input())
print(3*(a**2))

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(r*r*3)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):



import sys
import math
import bisect
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
mod = 10**9 + 7

r = int(input())
print(3*r**2)

Solution (Python):

N=int(input())

print(3*N**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3 * r**2)

Solution (Python):
n = int(input())
print( 3 * n * n)

Solution (Python):
print(3 * int(input()) ** 2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
N = int(input())
print(3*(N**2))

Solution (Python):


import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop

def main():
    r = int(input())
    print(3 * r * r)

if __name__ == '__main__':
    main()

Solution (Python):
def main():
  r = int(input())
  print(3*r*r)


if __name__ == '__main__':
  main()

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):

from __future__ import division, print_function

import os
import sys
from __builtin__ import xrange as range
from cStringIO import StringIO
from future_builtins import ascii, filter, hex, map, oct, zip
from io import IOBase

import __pypy__


def main():
    print(3 * int(input())**2)




BUFSIZE = 8192


class FastI(IOBase):
    def __init__(self, file):
        self._fd = file.fileno()
        self._buffer = StringIO()
        self.newlines = 0

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count("\n") + (not b)
            ptr = self._buffer.tell()
            self._buffer.seek(0, 2), self._buffer.write(b), self._buffer.seek(ptr)
        self.newlines -= 1
        return self._buffer.readline()


class FastO(IOBase):
    def __init__(self, file):
        self._fd = file.fileno()
        self._buffer = __pypy__.builders.StringBuilder()
        self.write = lambda s: self._buffer.append(s)

    def flush(self):
        os.write(self._fd, self._buffer.build())
        self._buffer = __pypy__.builders.StringBuilder()


def print(*args, **kwargs):
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


sys.stdin, sys.stdout = FastI(sys.stdin), FastO(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

Solution (Python):
a = int(input())
print(3 * a * a)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):
r = int(input())
print(3 * r**2)

Solution (Python):
a=int(input())
print(3*a*a)

Solution (Python):
k=int(input())

print(3*k*k)

Solution (Python):
a = int(input())
print(3 * a * a)

Solution (Python):
n = int(input())
print(3*n*n)

Solution (Python):
A = int(input())
print(3*(A**2))

Solution (Python):
N=int(input())
print(N*N*3)

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
N = int(input())
print(3*N*N)

Solution (Python):
a = int(input())
aa = 3 * a * a
print(aa)

Solution (Python):
i = int(input())
print(3*i**2)

Solution (Python):

r = int(input())
print(3 * r**2)

Solution (Python):
a = int(input())
print(3 * a ** 2)

Solution (Python):
print(int(input()) ** 2 * 3)

Solution (Python):

import sys
INF = float("inf")


def solve(r: int):
    print(r*r*3)
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  
    solve(r)


if __name__ == '__main__':
    main()

Solution (Python):
r=int(input())
print(r*r*3)

Solution (Python):
r = int(input())

print(3 * r ** 2)

Solution (Python):
n = int(input())
print(3 * n ** 2)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
n=int(input())
print(3*(n**2))

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')

n = int(input())
print(3 * n * n)

Solution (Python):
r = int(input())

print(3 * r * r)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):

n = int(input())
print(3*n*n)

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    n = I()
    print(3*n**2)
    return


def B():
    n = I()

    return


def C():
    n = I()

    return


def D():
    n = I()

    return


def E():
    n = I()

    return


def F():
    n = I()

    return


if __name__ == "__main__":
    A()

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(input())
def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(input().split())

r = inp()
print(3*r*r)

Solution (Python):
a = int(input())
print(3 * a * a)

Solution (Python):
n=int(input());print(3*n*n)