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



Sample input:
4


Sample output:
48

Submission status: Accepted

Solution code:
#######################################
import numpy as np
import math
import copy
import re
import sys
#sys.exit(0)

inf = float("inf")
prime = 1

def check_print(check_flag, text, end="\n"):
  if check_flag:
    print(text, end=end)

def c2i(x):
    if str.isdecimal(x):
        return int(x)
    else:
        return x

def cout(*args):
  arglist = []
  for arg in args:
    if hasattr(arg, "__iter__"):
      arglist.extend(arg)
    else:
      arglist.append(arg)
      
  arglist = list(map(str, arglist))
  print(" ".join(arglist))
  
def count2(num):
  count=0
  while num%2==0:
    num/=2
    count+=1
  return count

def ketasum(num):
  nums = [int(s) for s in str(num)]
  return sum(nums)

#math
def gcd(a, b): #最大公約数
  while b:
    a, b = b, a % b
  return a

def lcm(a, b): #最小公倍数
  return a * b // gcd (a, b)

def gcd3(lis): #最大公約数(3over)
  ans = lis[0]
  for li in lis:
    ans = gcd(ans,li)

def lcm3(lis): #最小公倍数(3over)
  ans = lis[0]
  for li in lis:
    ans = lcm(ans,li)

def divisor(n): #nの約数を全て求める
  i = 1
  table = []
  while i * i <= n:
    if n%i == 0:
      table.append(i)
      table.append(n//i)
    i += 1
  table = list(set(table))
  return table

def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(i)
    i += 1
  if n > 1:
    table.append(n)
  return table

def is_prime(n):
  for i in range(2, n + 1):
    if i * i > n:
      break
    if n % i == 0:
      return False
  return n != 1

#input stock
"""
n = int(input())

#list
a = map(int, input().split())
a,b = map(int, input().split())

d=[]
for i in range(n):
  d[i]=int(input())

#2dim-list
a = [list(map(int, input().split())) for i in range(n)]

s = input()
ss =  [int(si) for si in s]
"""

#processing stock
"""
a = sorted(a)
a = sorted(a, reverse=True)

"""

#regex
"""
pattern = ""
result = re.search(pattern, s)

result = re.fullmatch(pattern, s)

result = re.finditer(pattern, s)
for res in result:
    print res.group()   # 1回目: ca      2回目: ca   
    print res.start()   # 1回目: 0       2回目: 6      
    print res.end()     # 1回目: 2       2回目: 8      
    print res.span()    # 1回目: (0, 2)  2回目: (6, 8)
"""

#######################################
r = int(input())

print(3*r**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
#intで文字列をintに変換する

print(3*r*r)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  # type: int
    solve(r)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
a = int(input())
print(3*a**2)

Submission status: Accepted

Solution code:
# a,b,c=map(int,input().split())
n=int(input())

print(3*n*n)

Submission status: Accepted

Solution code:
# Dodecagon
r = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A  = int(input())
print(3*A*A)

Submission status: Accepted

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


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
def A_Dodecagon():
    r = int(input())
    print(3*r*r)
if __name__ == "__main__":
    A_Dodecagon()

Submission status: Accepted

Solution code:
r = int(input())

print(r*r*3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3*(r*r))

Submission status: Accepted

Solution code:
# input r
r = int(input())
print(3*r*r)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r  = int(input())

print( 3 * r * r )

Submission status: Accepted

Solution code:
def p_a():
    print(int(input()) ** 2 * 3)

if __name__ == '__main__':
    p_a()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import decimal
a = decimal.Decimal(int(input()))
print(3 * a * a)

Submission status: Accepted

Solution code:
r=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

input = input().split()
a = int(input[0])

ans = 3 * a * a

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

r = int(input())

print(3*r*r)

Submission status: Accepted

Solution code:
r = int(raw_input())
print(3*r*r)

Submission status: Accepted

Solution code:
def test():
    r = int(input())
    print(3*r**2)


if __name__ == "__main__":
    test()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    # input = sys.stdin.readline
    # A, P = map(int, input().split())
    r = int(input())
    # return (3*A + P) // 2
    return(3*r*r)


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

Submission status: Accepted

Solution code:
r = int(input())

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

print(cal_S(r))

Submission status: Accepted

Solution code:
r = int(input())

result = 3 * r **2

print(result)

Submission status: Accepted

Solution code:
inp = int(input())
s = 3 * inp ** 2
print(s)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
# /usr/bin/python3

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

if __name__=='__main__':
  main()

Submission status: Accepted

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

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = int(input())

a = 3 * i * i

print(a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

r = int(input())

print(3*r**2)

Submission status: Accepted

Solution code:
def solve(string):
    return str(3 * int(string)**2)


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

Solution code:
r = int(input())
result = 3*r*r

print(result)

Submission status: Accepted

Solution code:
#A https://atcoder.jp/contests/abc134/tasks/abc134_a
r=int(input())  #数値入力 「N」だけの入力のとき
#r=4
print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
radius = int(input().strip())
print(3 * (radius ** 2))

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
def solve():
    r = int(input())
    return 3 * r ** 2


if __name__ == "__main__":
    print(solve())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#h = list(map(int, input().split()))
r = int(input())
#p = list(map(int, input().split()))

print(3*r*r)

Submission status: Accepted

Solution code:
r = int(input())

print( 3 * (r * r))

Submission status: Accepted

Solution code:
# A - Dodecagon

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

Submission status: Accepted

Solution code:
"""
- https://atcoder.jp/contests/abc134/tasks/abc134_a
- 3*a^2
"""

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

Submission status: Accepted

Solution code:
def resolve():
    s = int(input())
    print(s * s * 3)
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(raw_input())
print(3*(a**2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
b=r*r
c=b*3
print(c)

Submission status: Accepted

Solution code:
#L,R=map(int,input().split())
r=int(input())
print(3*(r**2))

Submission status: Accepted

Solution code:
s = int(input())
print(s*s*3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
print(3 * r * r, end=" ")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print(int(s) **2 * 3)

Submission status: Accepted

Solution code:
def iread():
    return int(input())


def sread():
    return input()


def aread_int():
    tmp = input().split()
    ret = [int(i) for i in tmp]
    return ret


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


if __name__ == '__main__':
    a = iread()
    print(3 * a * a)

Submission status: Accepted

Solution code:
print(str(3 * int(input())**2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    r = int(sys.stdin.readline())
    print(3 * (r ** 2))

Submission status: Accepted

Solution code:
r = int(input())

s = 3 * r ** 2

print(s)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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

print(int(A))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=int(a)

if b >= 0 and b <= 100:
  print(3*pow(b,2))

Submission status: Accepted

Solution code:
r = int(input(''))
print(3 * r * r)

Submission status: Accepted

Solution code:
r = input()

r = int(r)

ans = 3 * (r ** 2)

print(ans)

Submission status: Accepted

Solution code:
n1 = int(input())

print(3 * n1 * n1)

Submission status: Accepted

Solution code:
r = int(input())

S = 3 * r * r

print(S)

Submission status: Accepted

Solution code:
r = int(input())
m = 3*r*r
print(m)

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
a=0
b=s[0]**2*3
print(b)

Submission status: Accepted

Solution code:
r=int(input())

print(3 * r * r)

Submission status: Accepted

Solution code:
i = input()
r = int(i)

s = 3 * r * r 

print(  "%d" % s )

Submission status: Accepted

Solution code:
hankei = int(input())
ans = 3*(hankei*hankei)
print(ans)

Submission status: Accepted

Solution code:
i=int(input())
print(i*i*3)

Submission status: Accepted

Solution code:
r=int(input())
area= r*r*3
print(area)

Submission status: Accepted

Solution code:
r = int(input())
area = 3 * (r * r)
print(area)

Submission status: Accepted

Solution code:
a = int(input())

print( 3 * a * a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

area = 3*a**2
print(area)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
import math

n = int(input())
#a, b = [int(i) for i in input().split()]
#table = [[int(i) for i in input().split()] for j in range(n)]
#table = [list(input()) for n in range(h)]
#list = [int(i) for i in input().split()]
#num = [int(i) for i in range(n)]
#s = input()
#list = list(s)
#temp = [[0 for _ in range(13)] for _ in range(13)]

print(3*n*n)

Submission status: Accepted

Solution code:
i = int(input())
print(3 * i * i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
print("{}".format(3*(r**2)))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    r = int(raw_input())
    print 3*r*r

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def main():
	n = int(input().strip())
	print(3 * n **2)

if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

menseki = 3 * r * r
print(menseki)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  # type: int
    solve(r)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(3*N**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = input()

r = int(r)

print(3 * r * r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = int(input())
out = 3*i*i
print(out)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
r = int(input())
print(3*r*r)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
a=int(input())
d=0
while d<10000000:
  d+=1
print(3*a*a)

Submission status: Accepted

Solution code:
r=int(input())

ans=3*r*r
print(ans)

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
  sys.stdin=open('input134a.txt')

#+++++

r = int(input())
#n, a, b= map(int, input().split())

print(3*r*r)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(r: int):
    print(3 * r * r)
    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))  # type: int
    solve(r)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

r=input()
r=int(r)

def area_12(x):
    area=3*(r**2)
    return area

area=area_12(r)

print(area)

Submission status: Accepted

Solution code:
r = int(input())

area = 3*r*r

print(area)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
hankei = int(input())
print(3*(hankei*hankei))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
print 3*pow(a,2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)

#dp[i][j]: iまでからj枚えらんで和がkになるのは何通り
def main():
	n  = int(input())
	print(3*n**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()

Submission status: Accepted

Solution code:
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)

#dp[i][j]: iまでからj枚えらんで和がkになるのは何通り
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())

print(3*a*a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
r = int(input())
#rを定義してる
print("{}".format(3*r*r))
#出力したんや

Submission status: Accepted

Solution code:
r = int(input())

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

Submission status: Accepted

Solution code:
"""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)

Submission status: Accepted

Solution code:
a = int(input())

b = 3*a**2

print(b)

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

S = int(S)

S = 3 * S**2

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

ans = 3 * r**2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(kotae)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 整数の入力
a = int(input())
# 正十二角形の面積の出力
print("{}".format(3 * a * a))

Submission status: Accepted

Solution code:



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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r =int(input())  

print(3*r**2)

Submission status: Accepted

Solution code:
#abc134a

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- encoding : UTF-8 -*-
r = int(input())

s = 3 * (r ** 2)

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
R = int(input())

print(3*R**2)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main10()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print( 3 * r * r)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
r = int(input())
S = 3*r*r
print(S)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

N = int(input())

print(3 * (N ** 2))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

ans = 3 * r * r

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print( 3 * (r ** 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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')

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

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()