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

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

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

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

print(3*(N**2))

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

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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

z = 3*r*r
print(z)

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

print(3 * r**2)

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

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

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

Solution (Python):
import sys


def main():
    input = sys.stdin.buffer.readline
    r = int(input())
    print(3 * r * r)


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

print(3*N**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**2))

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

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

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

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7

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

        
    
            
        

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

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

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

print(3 * r**2)

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

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

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

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

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

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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


if __name__ == '__main__':
    main()

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

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

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

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

print(main())

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

    ans = 3 * r ** 2

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")

INF = float("inf")


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

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):
print(3*int(input())**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):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


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())

area = 3 * r * r

print(area)

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

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

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

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

print(3*(r**2))

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

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

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

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

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

Solution (Python):

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


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

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

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

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

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

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

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

Solution (Python):
def area(x):
    area = 3 * x * x
    print(area)

area(int(input()))

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

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

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):
import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
r = int(lines.pop(0))
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 * pow(r, 2))

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

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

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

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

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

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

print(3*(r**2))

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

r=k()
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**2)

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

print(3 * r ** 2)

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

Solution (Python):


def main():

    r = int(input())

    ans = 3 * r ** 2

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):

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

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

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

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











































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    r = int(lines[0])
    
    
    
    
    
    
    
    
    

    result = 3 * r**2

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['4']
        lines_export = [48]
    if pattern == 2:
        lines_input = ['15']
        lines_export = [675]
    if pattern == 3:
        lines_input = ['80']
        lines_export = [19200]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

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

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

print(r**2 * 3)

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque, defaultdict


from collections import Counter

from itertools import accumulate,combinations,permutations,product

from heapq import heapify,heappop,heappush

from functools import reduce,lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): 
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    

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





if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

Solution (Python):
print(eval("3*"+input()+"**2"))

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

Solution (Python):
import sys
import math

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


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


if __name__ == "__main__":
    main()

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

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

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

if not ( 1 <= r <= 100 ): sys.exit()

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

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

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

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

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

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

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

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

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

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

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

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

print(3*r**2)

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

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

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

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

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):
import sys, math
from collections import defaultdict
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

r = ri()

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

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

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


import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

def main():
    r = ni()
    print(3 * r ** 2)

if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    r = I()

    print(3 * r ** 2)

if __name__ == '__main__':
    resolve()

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

Solution (Python):

n = int(input())


print(3*n**2)

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

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

print(3*r*r)

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

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

    
if '__main__' == __name__:
    resolve()

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

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

print(3*r**2)

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

menseki = 3 * r * r

print(menseki)

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

Solution (Python):


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

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

print(int(3 * radius **2))

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

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

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

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

if __name__ == '__main__':
    main()

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

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

area = 3*r**2

print(area)

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

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

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

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

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

Solution (Python):

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

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

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

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

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

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


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

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

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

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):
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

print(r*r*3)

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

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

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    r = int(readline())
    print(3 * r * r)
    
    return


if __name__ == '__main__':
    main()

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

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

print(3*r**2)

Solution (Python):
s=input()
a=int(s)
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):
import sys
a=sys.stdin.readline()
res=[i for i in a.split()]
r1=float(res[0])
v=r1.is_integer()
if v==True:
    r=int(r1)
    if 1<=r<=100:
        print(3*r*r)

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

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

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

Solution (Python):
a = list(map(int, input().split()))[0]
print((a * a) * 3)

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

Solution (Python):
r=int(input())
if 1<= r<= 100:
    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*r)

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

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

print(3*r**2)

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

if __name__ == '__main__':
    solve()

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

print(int(3*r*r))

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

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

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

print(3*(r**2))

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)

r = int(input())

ans = 3*r**2

print(ans)

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

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

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

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

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

Solution (Python):

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

Solution (Python):

r = int(input())

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

Solution (Python):

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    r = int(input())
    res = 3 * pow(r, 2)
    print(res)


if __name__ == '__main__':
    resolve()

Solution (Python):



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

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

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    print(3 * pow(int(input()), 2))

    return 0

if __name__ == "__main__":
    solve()

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

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

Solution (Python):






from collections import defaultdict











import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
r = I()
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):
r = int(input())
print(3*r**2)

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

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

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

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

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

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

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

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

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

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

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

print(A**2*3)

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

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

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

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