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):
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)


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


def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(m,n):
	x = max(m,n)
	y = min(m,n)
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	return y

class queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

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

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

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

Solution (Python):


def solve():
    r = int(input())
    print(3*r**2)

if __name__ == "__main__":
    solve()

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

print(3 * r ** 2)

Solution (Python):
input_data=input()
input_data=input_data.split()
r=int(input_data[0])

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

Solution (Python):
from sys import stdin
r = int(stdin.readline().rstrip())
print(3*(r**2))

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

print(3*r*r)

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

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

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):
r = int(input())

print(3*r*r)

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

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

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

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("{}".format(3*r*r))

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

print("{}".format(3*r*r))

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

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

print(3 * (r ** 2))

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

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

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

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

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

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

Solution (Python):
print((int(input())**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):
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):
"""Dodecagon Program
"""
import sys

def calc_area(num):
    """Calcurate area Method
    """
    if isinstance(num, float):
        return
    if (num < 1) or (num > 100):
        return
    return 3 * num * num

if __name__ == "__main__":
    try:
        num = int(input())
    except ValueError:
        sys.exit(1)
    print(calc_area(num))
    sys.exit(0)

Solution (Python):
"""Dodecagon Program
"""
import sys

def calc_area(num):
    """Calcurate area Method
    """
    if isinstance(num, float):
        return
    if (num < 1) or (num > 100):
        return
    return 3 * num * num

if __name__ == "__main__":
    try:
        num = int(input())
    except ValueError:
        sys.exit(1)
    print(calc_area(num))
    sys.exit(0)

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

print(3 * r * r)

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

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

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

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

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

b = 3*a**2

print(b)

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

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    r = int(input())
    print(3 * pow(r, 2))
    
 
if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

Solution (Python):
r = int(input())
print(3*r**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):
a = int(input())
print(3 * a ** 2)

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

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

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

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

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):
r = int(input())
print(3*r*r)

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

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

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

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

print(3 * r**2)

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

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

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

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

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

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

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):
S = input()

S = int(S)

S = 3 * S**2

print(S)

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

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

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

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

ans = 3 * r**2

print(ans)

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

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*r)

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

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

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

print(kotae)

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

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

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

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

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

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

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

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

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

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

Solution (Python):

a = int(input())

print("{}".format(3 * a * a))

Solution (Python):



def fun(r):
  a = 3 * r**2
  return a

r = int(input())
print(fun(r))

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

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

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*r)

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

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

print(3*r**2)

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

Solution (Python):


r=int(raw_input())
print 3*r*r

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

Solution (Python):

r = int(input())

s = 3 * (r ** 2)

print(s)

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

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):
a=int(input());
print(3*a**2);

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

Solution (Python):




import math
import statistics

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

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

print(3*r*r)

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

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

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

Solution (Python):
from heapq import heappush, heappop
import re
from collections import deque
import sys
import math
input = sys.stdin.readline


def int_raw():
    return int(input())


def ss_raw():
    return input().split()


def ints_raw():
    return tuple(map(int, ss_raw()))


DIV = 10**9+7


def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def ncr(n, r, mod=DIV):
	r = min(r, n-r)
	ret = 1
	for i in range(1, r+1):
		ret = ret * (n-i+1) % mod
		ret = ret * mod_inv(i, mod) % mod
	return ret


def main():
    r =int_raw()
    return r*r*3
print(main())

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

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

Solution (Python):



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


if __name__ == '__main__':
    main()

Solution (Python):
print(3 * int(input())**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 ** 2)

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

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

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

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

print(3*R**2)

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

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

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

print(3*r*r)

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

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

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

Solution (Python):
def main10():
    num = int(input())
    result = num * num * 3
    print(result)

if __name__ == "__main__":
    main10()

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

print(3*r*r)

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
print(3*(int(input())**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**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):
n = int(input())
print(3*(n**2))

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

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

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

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

print(3*a**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*n)

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

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

Solution (Python):


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

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

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

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

N = int(input())

print(3 * (N ** 2))

Solution (Python):
def solve(a):
    return 3*(a**2)

r = int(input())
print(solve(r))

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

Solution (Python):
def main(r):
    if (1 <= r <= 100) :
        twelve_poly = 3*r**2 
    return twelve_poly

if __name__ == '__main__':
    s = list(map(int, input().split()))
    huga = main(s[0])
    print(huga)

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

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

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

ans = 3 * r * r

print(ans)

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):
print(3* int(input())**2)

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

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

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

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

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

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):
r = int(input())

print(3*r**2)

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

print( 3 * (r ** 2))

Solution (Python):
from enum import Enum
from queue import Queue
import collections

import sys
import math

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

r = int(input())

print(3*r**2)

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):
r = int(input())
print(3 * (r**2))

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

Solution (Python):
from sys import stdin

r = int(stdin.readline().rstrip())
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())
r2=(r**2)*3
print(r2)

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys, math, bisect, random, itertools
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    n = II()
    print(n*n*3)
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

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):
print(3*(int(input())**2))

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

ans = 3*r*r
print(ans)

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*r)

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

print(3*r*r)

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

Solution (Python):


def main():
    print( int(input())**2*3)
if __name__ == '__main__':
    main()

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

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

print(3*r**2)

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

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

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

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

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

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

Solution (Python):
if __name__ == "__main__":
    A = int(input())
    print(3*(A*A))

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

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
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 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

r=INT()

print(3*r**2)

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

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

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

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

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

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

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

Solution (Python):
import sys, math, itertools, bisect, copy, re
from collections import Counter, deque, defaultdict






INF = float('inf')
MOD = 10 ** 9 + 7
EPS = 10 ** -7
sys.setrecursionlimit(1000000)









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

pass

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

print(3*(a**2))

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

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

print(r*r*3)

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

if __name__ == '__main__':
    main()

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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

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

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

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

print(3 * r ** 2)

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

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

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

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

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

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

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

Solution (Python):
print(3*int(input())**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(r**2*3)

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

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

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

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

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

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

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

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

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

Solution (Python):
a = input()
a = int(a)
print("{}".format(3*a*a))

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

Solution (Python):
print(int(input())**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**2))

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

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

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

Solution (Python):


import sys
import copy

sys.setrecursionlimit(1000000)


from collections import defaultdict



r = int(input())

print(3 * r * r)

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

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

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

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())
ans = 3 * r ** 2
print(ans)

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

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

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

Solution (Python):

def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
r=I()
print(3*r*r)

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

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

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

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

Solution (Python):
def menseki(x):
    return 3*x**2

print(menseki(int(input())))

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

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

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

print(3*r*r)

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

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

Solution (Python):

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

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

Solution (Python):
try:
    r = int(input())
    print(r*r*3)
except ValueError:
    print("mistaking input")

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

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

Solution (Python):
i =int(input())
print(3*i**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):
r = int(input())

print(3*r**2)

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

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

Solution (Python):

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

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

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

print(3*r*r)

Solution (Python):
def main():
	import sys
	input = sys.stdin.readline
	r = int(input())
	print(3*r**2)

if __name__ == '__main__':
    main()

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

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

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

S = 3*a*a

print(S)

Solution (Python):


a = int(input())

b = a ** 2 * 3

print(b)

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

print(3 * r ** 2)

Solution (Python):
if __name__ == '__main__':
    a = int(input())
    i = 3 * a * a
    print(i)

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

print(3 * (r ** 2))

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

def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

r = SORO_INT()
x = 3*r*r
print(x)

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

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

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

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left, bisect_right, insort_left, insort_right
from operator import itemgetter as ig
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20; INF = float("INF"); ans = 0; tmp = 0; ansli = []; tmpli = []; candili = []
eps = 1.0 / 10 ** 10; mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]; ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]; ddn9 = ddn + [(0, 0)]
"""for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:"""
def wi(): return list(map(int, sys.stdin.readline().split()))
def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def ws(): return sys.stdin.readline().split()
def i(): return int(sys.stdin.readline())
def s(): return input()
def hi(n): return [i() for _ in range(n)]
def hs(n): return [s() for _ in range(n)]
def mi(n): return [wi() for _ in range(n)]
def mip(n): return [wip() for _ in range(n)]
def ms(n): return [ws() for _ in range(n)]

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

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

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

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

print(3*r*r)

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):
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):
x=int(input())
print(3*x*x)

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

Solution (Python):
from sys import stdin

print(int(3 * (int(stdin.readline().rstrip()) ** 2)))

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

print(3*A**2)

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

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

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

Solution (Python):
r = input()
r = int(r)
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):
a=int(input())
print(3*(a*a))

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

Solution (Python):


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

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

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

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

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

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

Solution (Python):

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

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

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):
print(3*int(input())**2)

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

print(3 * r * r)

Solution (Python):

R= int(input())
ans =3*R*R
print(ans)

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

print(3*N**2)

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

Solution (Python):

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

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

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

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

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

print(3*a*a)

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

print(3 * r * r)

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

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

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

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

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

print(3 * r**2)

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

Solution (Python):

import sys


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



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):
a = int(input())
print(3*a*a)

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

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):
r = int(input())

a = 3 * r ** 2

print(a)

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):
import sys

def solve(r):
    return 3 * r**2


if __name__ == '__main__':
    r = int(sys.stdin.readline().strip())
    print solve(r)

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

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

Solution (Python):
r=int(input())
print('{0}'.format(3*r*r))

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

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Solution (Python):






	
r = input()
	


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

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

print(3 * r ** 2)

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

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())
v = 3 * r * r
print(v)

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

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

Solution (Python):


def main():
    r = int(input().strip())
    return(3 * r * r)

if __name__ == '__main__':
    print(main())

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


if __name__=="__main__":
    main()

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

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