Problem:
 Score : 200 points    Problem Statement Find the largest square number not exceeding N . Here, a square number is an integer that can be represented as the square of an integer.      Constraints  1 \leq N \leq 10^9  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output Print the largest square number not exceeding N .        Sample Input 1 10      Sample Output 1 9  10 is not square, but 9 = 3 × 3 is. Thus, we print 9 .       Sample Input 2 81      Sample Output 2 81       Sample Input 3 271828182      Sample Output 3 271821169

Solution (Python):
import math


N=int(input())

print(int(math.sqrt(N))*int(math.sqrt(N)))

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

for i in range(10**9):
    if i ** 2 > n:
        print((i-1) ** 2)
        exit()

Solution (Python):
n = int(input())
import math
ans = math.floor(math.sqrt(n))
print(ans**2)

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

print(int(N**0.5)**2)

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

Solution (Python):
n=int(input())
a=1
while a<=n+2:
 if a*a<=n:
  a+=1
 else:
  print((a-1)**2)
  break

Solution (Python):
import math
print(int(math.sqrt(int(input())))**2)

Solution (Python):
N = int(input())
a = 0
for i in range(N):
    if i**2 > N:
        a = i
        break
print((a-1)**2)

Solution (Python):
N=int(input())
for i in range(N):
    if float.is_integer((N-i)**(1/2)):
        print(N-i)
        break

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
n=int(input())
i=1
while i**2<=n:
    ans=i**2
    i+=1
print(ans)

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

Solution (Python):
import math
print(pow(math.floor(math.sqrt(int(input()))), 2))

Solution (Python):
n = int(input())
 
tmp = 1
 
for i in range(1,pow(10,9)):
    tmp = pow(i,2)
    if tmp > n:
        print(pow(i-1,2))
        break

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

tmp = 1

for i in range(1,pow(10,9)):
    tmp = pow(i,2)
    if tmp > n:
        print(pow(i-1,2))
        break

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
from functools import partial, reduce
from operator import mul
prod = partial(reduce, mul)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

fibo = [1, 1]
for i in range(2, 9):
    fibo.append(fibo[i - 1] + fibo[i - 2])

def main():
    N = II()
    ans = int(N ** 0.5) ** 2
    return ans

print(main())

Solution (Python):
x = int(input())
res = 0
i = 0

while res <= x:
  i += 1
  res = i ** 2

print((i-1)**2)

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

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

Solution (Python):
n = int(input())
for i in range(n+1):
  m = (i+1) ** 2
  if m > n:
    print(i**2)
    break

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

a=n

for i in range(n):
  if (float.is_integer(a**0.5)):
    print(a)
    break
  else:
    a=a-1

Solution (Python):
X = int(input())
print(int(X**0.5)**2)

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

Solution (Python):
from math import sqrt
n = int(input())
for i in range(n,0,-1):
    if sqrt(i).is_integer():
        print(i)
        break
    else:
        continue

Solution (Python):
N=int(input())
for i in range(1,N+2): 
	if i**2<=N: Key=i**2
	else: 
		print(Key)
		break

Solution (Python):
import math
n=int(input())
print(math.floor(math.sqrt(n))**2)

Solution (Python):
def hantei(n):
  seisu = int(n**.5)
  if n == seisu*seisu:
    return True
  else:
    return False

N = int(input())
for i in range(1, N+1)[::-1]:
  if hantei(i):
    break
print(i)

Solution (Python):
n=int(input())
ans=0
for i in range(10**5):
    x=i**2
    if n>=x:
        ans=x
    else:
        break
print(ans)

Solution (Python):
n=int(input())
for i in range(n,0,-1):
    j=i**0.5
    if j.is_integer():
        print(i)
        break

Solution (Python):
N=int(input())
for x in range(1145141919810):
	if x*x > N:
		x-=1
		print(x*x)
		break

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    N = int(input())
    N2 = math.floor(math.sqrt(N))
    print(N2**2)
    
if __name__ == '__main__':
    main()

Solution (Python):


a = int(input())
i=0
while i*i <= a:
  i=i+1

i=i-1

print(i*i)

Solution (Python):
import math as chokudai
N = int(input())
print(int(chokudai.sqrt(N))*int(chokudai.sqrt(N)))

Solution (Python):
n=int(input())
for i in range(n+2):
    if (i)**2 >n:
        print((i-1)**2)
        break

Solution (Python):


def solve(n):
  ret = 1
  while True:
    if (ret+1)**2 > n:
      return ret**2
    else:
      ret += 1

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

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

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):

import math


def read_input():
    n = int(input())
    return n

def submit():
    n = read_input()

    t = math.floor(math.sqrt(n))
    print(t*t)

if __name__ == '__main__':
    submit()

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n = f()[0]
    x = int(n**0.5)
    print(x*x)

solve()

Solution (Python):
import math
n=int(input())
while  math.ceil(n**0.5) != math.floor(n**0.5):
      n=n-1

print(n)

Solution (Python):
n = int(input())
ans = int(n**.5)**2
print(ans)

Solution (Python):
import numpy as np

N = int(input())

mp = int(np.sqrt(N))
print(mp**2)

Solution (Python):
n = int(input())
for i in range(n, 0, -1):
    calc = pow(i, 0.5)
    if calc.is_integer():
        break
print(i)

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

Solution (Python):
N = int(input())
for i in range(N + 1)[::-1]:
    sqrt = int(i ** (1 / 2))
    if sqrt ** 2 == i:
        print(i)
        break

Solution (Python):
import sys
from collections import Counter

n = int(input())

for i in range(n, 0, -1):
    if pow(i, 0.5) % 1 == 0:
        print(i)
        sys.exit()

Solution (Python):

from math import floor
n = int(input())
print(floor(pow(n, 0.5)) ** 2)

Solution (Python):
import numpy as np
import math

print(math.floor((int(input())**(1/2)))**2)

Solution (Python):
N = int(input())
i = 1
while(i**2<=N):
  i += 1
print((i-1)**2)

Solution (Python):

n=int(input())
x=0
while x**2<=n:
    x+=1

print((x-1)**2)

Solution (Python):
n = int(input())
for i in range(int(1e6)):
    if i**2>n:
        print((i-1)**2)
        break

Solution (Python):

n=int(input())
x=1

while (x+1)**2<=n:
    x+=1
print(x**2)

Solution (Python):
n=int(input())
i=1
while True:
    if i**2>n:
        print((i-1)**2)
        break
    i+=1

Solution (Python):
N = int(input())
x = 1
while (x+1)**2 <= N:
    x += 1
print(x**2)

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

m = 1
for i in range(1, N):
    if i**2 > N:
        break
    m = i**2
print(m)

Solution (Python):
N = int(input())
import math
n = math.floor(math.sqrt(N))
print(pow(n, 2))

Solution (Python):
import math
N = int(input())
for i in range(N, 0, -1):
	if math.sqrt(i).is_integer():
		print(i)
		exit()

Solution (Python):
import math

N = int(input())
print(math.floor(math.sqrt(N))**2)

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

Solution (Python):
import math

n = math.floor(math.sqrt(int(input())))
print(n * n)

Solution (Python):
import math

N = int(input())
a = math.sqrt(N)
a = int(a)
ans = a**2
print(ans)

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

i = 1
add = 3
while i + add <= N:
    i += add
    add += 2

print(i)

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

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

def ex_value(value):
	i = 1
	while value >= i**2:
		i += 1
	return (i-1) ** 2

print(ex_value(n))

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

Solution (Python):
N = int(input())
ans = 1
for i in range(1,N):
  if i**2 > N:
    break
  else:
    ans = i**2
    
print(ans)

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

n = 1
while True:
    if n**2 > N:
        break
    n += 1

print((n-1)**2)

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

Solution (Python):
N = int(input())
num = (N**(1 / 2)) // 1
print(int(num**2))

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

Solution (Python):
N = int(input())
ans = 0
for i in range(int(1e5)):
    if i**2 <= N:
        ans = i**2
    else:
        break
print(ans)

Solution (Python):
n=int(input())
tmp=0
while True:
    if tmp**2<=n:
        tmp+=1
    else:
        break

print((tmp-1)**2)

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

if 1 == N:
	print(1)
	exit()

vsum = 0
for i, v in enumerate(range(1, N * 2, 2)):
	
	vnext = vsum + v
	if N < vnext:
		print(i**2)
		break
	vsum = vnext

Solution (Python):
N = int(input())
for i in range(10 ** 5):
    if i ** 2 <= N:
        continue
    else:
        print((i - 1) ** 2)
        break

Solution (Python):
N = int(input())
sq = [i ** 2 for i in range(10 ** 5) if i ** 2 <= N]
print(sq[-1])

Solution (Python):
import math
N=int(input())
for i in range(1,100000):
    if i*i>N:
        key=i
        break
        
print((key-1)*(key-1))

Solution (Python):
n=int(input())
ans=1
for i in range(10**5):
  if i**2 <= n:
    ans=i**2
print(ans)

Solution (Python):
for i in range(int(input()), 0, -1):
    if not i**0.5%1:
        print(i)
        break

Solution (Python):
n = int(input())
x = 1
while n >= x*x:
	x += 1
print((x-1)*(x-1))

Solution (Python):
N = int(input())
ans = 0
i = 0
while i * i <= N:
    ans = i * i
    i += 1
print(ans)

Solution (Python):
import math
n = int(input())
print((math.floor(math.sqrt(n)))**2)

Solution (Python):
N = int(input())
heihousu = []
s = 0
t = 0
while (t <= N):
    s += 1
    t = s**2
    heihousu.append(t)
print(heihousu[-2])

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

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

Solution (Python):
n = int(input())
ans = 0
for i in range(int((n-1)**0.5), int(n**0.5)+1):
    ans = max(ans, i ** 2)

print(ans)

Solution (Python):
a = []
import bisect
for i in range(1,10**5+1):
    if i ** 2 > 10**9:
        break
    a.append(i**2)

n = int(input())
x = bisect.bisect_right(a,n)
print(a[x-1])

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
import math
n=int(input())
for i in range(n,-1,-1):
  num=math.floor(math.sqrt(i))
  if num**2==i:
    break
print(i)

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

for i in range(N,0,-1):
    kai = int(pow(i,0.5))
    if i == kai * kai:
        print(i)
        exit()

Solution (Python):
n = int(raw_input())
print int(n**0.5)**2

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

i = 0
while (i**2<=N):
    i+=1
print((i-1)**2)

Solution (Python):
import math

N = int(input())

x = math.floor(math.sqrt(N)) 

print(int(x*x))

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

for i in range(100000):
    if i * i > N:
        break
print((i - 1) * (i - 1))

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

Solution (Python):
import math
n = math.sqrt(int(input()))
print(math.floor(n)**2)

Solution (Python):
n=int(input())
import math
a=math.floor(math.sqrt(n))
print(a**2)

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

print(int(n ** 0.5) ** 2)

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

Solution (Python):
from sys import exit

N = int(input())

anss = 1
for i in range(1,N+1):
    if(i**2>N):
        anss = i-1
        break
print(anss**2)

Solution (Python):
import math

N = int(input())
for i in range(1,N+1)[::-1]:
    num = math.sqrt(i)
    if num == int(num):
        print(i)
        break

Solution (Python):
N = int(input())
ans = 0
for i in range(1, 10**9):
    if N < i ** 2:
        ans = (i-1) ** 2
        break
print(ans)

Solution (Python):
import math
print(math.floor(math.sqrt(int(input()))) ** 2)

Solution (Python):
import math
n=int(input())
print(int(math.sqrt(n))**2)

Solution (Python):
from math import floor, sqrt


def solve(string):
    return str(floor(sqrt(int(string)))**2)


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

Solution (Python):
n=int(input())
for i in range(int(n**.5)+1,0,-1):
  if n>=i**2:
    print(i**2)
    break

Solution (Python):
import math
n = int(input())
x = math.floor(math.sqrt(n))
print(x*x)

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

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

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

Solution (Python):
from sys import stdin
n = int(stdin.readline().rstrip())
for i in range(n, 0, -1):
    m = int(i**.5)
    if abs(m*m-i) < 1e-6:
        print(i)
        break

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

n =math.floor(math.sqrt(N))
print(n*n)

Solution (Python):
now=0
N=int(input())
while now**2<=N:
    now+=1
print((now-1)**2)

Solution (Python):
n = int(input())
ans = 0
for i in range(100000):
  if i*i > n:
    break
  ans = i*i
print(ans)

Solution (Python):


n = int(input())

for i in range(100000):
    if i * i > n:
        print((i-1)*(i-1))
        break

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

Solution (Python):
n=int(input())
ans=1
before=1
while 1:  
  hoge=ans**2
  if(n<hoge):
    break
  before=hoge
  ans+=1
  
print(before)

Solution (Python):
import math
n = int(input())
x = math.floor(n**0.5)
ans = x**2
print(ans)

Solution (Python):
import math 
N = int(input())
print(math.floor(math.sqrt(N))**2)

Solution (Python):
import math


N = int(input())
ans = [i*i for i in range(math.ceil(math.sqrt(N))+1) if i * i <= N]
print(ans[-1])

Solution (Python):

import math
n = int(input())
while math.sqrt(n)//1 != math.sqrt(n):
    n -= 1
print(n)

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

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

Solution (Python):

import numpy as np

N = int(input())
n=int(np.sqrt(N))
print(n**2)

Solution (Python):

import numpy as np

N = int(input())
print(int(np.sqrt(N)) * int(np.sqrt(N)))

Solution (Python):
import math;print(round((math.sqrt(int(input()))//1))**2)

Solution (Python):
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
ans = int(math.sqrt(N))
print(ans**2)

Solution (Python):
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
ans = [pow(i,2) for i in range(100000) if pow(i,2)<=N]
print(ans[-1])

Solution (Python):
n=int(input())
if n==1:
    print(1)

else:
    for i in range(1,n+1):
        x=i*i
        if x>n:
            print((i-1)*(i-1))
            exit()

Solution (Python):
import math
N = int(input())
while True:
    if math.sqrt(N) % 1 == 0:
        break
    N -= 1
print(N)

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

Solution (Python):
N = int(input())
nums = 0
for i in range(1, 100000):
    if i**2 <= N:
        nums = i
print(nums**2)

Solution (Python):


import itertools
import collections
import bisect

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

    ans =1
    i = 1
    while N >= i * i:
        ans = i * i
        i += 1
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
square=[]
for i in range(32000,0,-1):
  square.append(i*i)
n=int(input())
for i in range(32000):
  if n>=square[i]:
    print(square[i])
    exit()

Solution (Python):
n=int(input())
i=1
while i*i<=n:
    i+=1
print((i-1)*(i-1))

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

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

ans = 0
from math import sqrt
for i in range(int(sqrt(N)), 0, -1):
    if i * i <= N:
        ans = i * i
        break

print(ans)

Solution (Python):
N = int(input())
for i in range(10**10):
  if i**2 > N:
    print((i-1)**2)
    break

Solution (Python):
N = int(input())
num = int(N**(1/2))
print(num **2)

Solution (Python):
N = int(input())
num = 0
for i in range(1,100000000):
    if i*i> N:
        break
    else:
        num = i*i
print(num)

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

max_sq = 0
c = 0

l = []


for i in range(1,n+1):
	if   i*i <= n:
		l.append(i*i)
	if i*i > n:
		break      
        
print(max(l))

Solution (Python):
import math
N=int(input())
i=0
while True:
  if math.sqrt(N-i)==int(math.sqrt(N-i)):
    print(int(N-i))
    break
  else:
    i+=1

Solution (Python):
def around_square(N: int) -> int:
    n = 1
    while (n+1)*(n+1) <= N:
        n += 1
    return n * n


if __name__ == "__main__":
    N = int(input())
    ans = around_square(N)
    print(ans)

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    N = int(input())
    a = int(N**0.5)
    print(a**2)


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
square = [i*i for i in range(1, int(N**0.5)+1)]
print(max(square))

Solution (Python):
n = int(input())
x = 1
while x * x <= n:
    x += 1

x -= 1
print(x * x)

Solution (Python):
import bisect

n = int(input())
x = list(map(lambda x:x*x, list(range(40000))))

idx = bisect.bisect_right(x,n)
print(x[idx-1])

Solution (Python):
n = int(input())
m = int(n ** (1/2))
print(m ** 2)

Solution (Python):
n=int(input())
a=[]
for i in range(n+1)[::-1]:
    b=pow(i,0.5)
    if b==b//1:
        print(int(i))
        break

Solution (Python):
N = int(input())
for i in range(1, N + 2):
    if i ** 2 > N:
        print((i - 1) ** 2)
        break

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
from math import sqrt
n=int(input())
tmp=sqrt(n)
print(int(tmp)**2)

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

Solution (Python):
n = int(input())
for i in range(n,0,-1):
    if i**0.5 == int(i**0.5):
        ans = i
        break
print(ans)

Solution (Python):
import math

n = int(input())

for i in reversed(range(n+1)):
    if math.sqrt(i).is_integer() :
        print(i)
        break

Solution (Python):

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


"""
a = input()
b = input()
if a[2] == b[0] and a[1] == b[1] and a[0] == b[2]:
    print("YES")
else:
    print("NO")
"""


n = I()
n = int(math.sqrt(n))
print(n**2)

Solution (Python):

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


def A():
    s = S()
    t = S()
    if s+t == t[::-1]+s[::-1]:
        print("YES")
    else:
        print("NO")


def B():
    n = I()
    for i in range(int(n**0.5)+2)[::-1]:
        if i*i <= n:
            print(i*i)
            quit()

def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == "__main__":
    B()

Solution (Python):
import math

def A():
    a, b = [int(x) for x in input().split()]
    print(math.ceil((a + b)/2))

def B():
    a = ''.join(sorted(list(input()), key=lambda x:ord(x)))
    b = ''.join(sorted(list(input()), key=lambda x:-ord(x)))
    if a < b:
        print('Yes')
    else:
        print('No')

def C():
    N = input()
    A = [x for x in input().split()]
    counter = {}

    for a in A:
        if(a in counter):
            counter[a] += 1
        else:
            counter[a] = 1
    remove_count = 0
    for key in counter:
        if counter[key] - int(key) >= 0:
            remove_count += counter[key] - int(key)
        else:
            remove_count += counter[key]
    print(remove_count)

def E():
    s1 = input()
    s2 = input()
    if s1 == s2[::-1]:
        print('YES')
    else:
        print('NO')

def F():
    a = int(input())
    sqrt = math.floor(math.sqrt(a))
    print(sqrt*sqrt)
F()

Solution (Python):
n = int(input())
i = 1
while 1:
    i += 1
    if i * i > n:
        break
i -= 1
print(i * i)

Solution (Python):
N = int(input())
maxnum = 0
for i in range(1,100000000):
    if i*i>N:
        break
    else:
        maxnum = i*i
print(maxnum)

Solution (Python):
n = int(input())
for i in range(1,10 ** 5):
    if i * i > n:
        print((i-1) * (i-1))
        exit()

Solution (Python):
import math
N=int(input())
r=math.sqrt(N)
num=math.floor(r)
ans=num**2
print(ans)

Solution (Python):
n=int(input())
x=int(n**0.5)

print(x**2)

Solution (Python):
import math
N = int(input())
print((math.floor(math.sqrt(N)))**2)

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

ans = 1
while a >= ans * ans:
    ans += 1
ans -= 1
print(ans * ans)

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

Solution (Python):
import math


def main():
    N = int(input())
    x = int(math.sqrt(N))
    print(x**2)


if __name__ == "__main__":
    main()

Solution (Python):
from math import sqrt

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

N = int(input())
ma = int(sqrt(N))
if ma*ma <= N:
    print(ma**2)
else:
    print((ma-1)**2)

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

Solution (Python):
""" AtCoder """

N = int(input())

N = int(N**(1/2))

print(N**2)

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

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
import math
N = int(input())
n = int(math.sqrt(N))
print(n*n)

Solution (Python):
n=int(input())
for i in range(10**9):
    if i**2>n:
        print((i-1)**2)
        break

Solution (Python):
import numpy as np

INF=1e18
MOD=1e9+7

N=int(input())

print(int(np.sqrt(N))**2)

Solution (Python):
import math
N = int(input())
n = int(math.sqrt(N))
print(n*n)

Solution (Python):

from math import sqrt
N = int(input())
print(int(sqrt(N))**2)

Solution (Python):
import numpy as np
n=int(input())
print(int(np.sqrt(n))**2)

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

Solution (Python):
N=int(input())
for i in range(1,N+1):
  if i**2>N:
    break
  answer=i**2
print(answer)

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

print( int(N**0.5)**2 )

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

ans = 0
for i in range( int(N**0.5)+1 ):
    ans = max( ans, i*i )

print( ans )

Solution (Python):
n=int(input())
for i in reversed(range(n+1)):
    if i**0.5==int(i**0.5):
        print(i)
        break

Solution (Python):
import math
n = int(input())
print(int(math.sqrt(n))**2)

Solution (Python):
import math

n = int(input())
print(math.floor(n ** 0.5) ** 2)

Solution (Python):
n = int(input())
i=1
res = 0
while i*i<=n:
    res = i*i
    i+=1
print(res)

Solution (Python):
n = int(input())
for i in range(n):
    if n < i*i:
        break
print(max(1, (i-1)**2))

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

Solution (Python):
import math
print(int(math.sqrt(int(input())))**2)

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

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

Solution (Python):
N = int(input())
for i in range(0,N+1,1):
  if i*i == N:
    print(N)
    break
  elif (i+1)*(i+1) > N:
    print(i*i)
    break

Solution (Python):

import math
n=int(input())
print(int(math.sqrt(n))**2)

Solution (Python):
n = int(input())
i = 1
while True:
    if i ** 2 > n:
        print((i-1)**2)
        break
    i += 1

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

Solution (Python):
N = input()
r = 0
while True:
  if r*r > N:
    break
  r += 1
print (r-1)**2

Solution (Python):
from math import sqrt
N = int(input())
for i in range(int(sqrt(N))+1,0,-1):
    if i*i <= N:
        ans = i*i
        break
print(ans)

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

for i in range(n,1,-1):
    if (i**(1/2)).is_integer():
        print(i)
        break
else:
    print("1")

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
import math
print(math.floor(int(input())**0.5)**2)

Solution (Python):
N=int(input())
n=int(N**(1/2))
print(n**2)

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

test = int(float(n**0.5)//1)

print(test**2)

Solution (Python):
import math

N = int(input())
n = math.floor(math.sqrt(N))
print(n**2)

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

Solution (Python):
a=[i**2 for i in range(1,100000)]
t=int(input())
for s in range(len(a)):
  if t<a[s]:
    print(a[s-1])
    break

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

Solution (Python):
N=int(input())
ans=1
for i in range (1,N):
	if i*i<=N:
		ans=i*i
	else:
		break
print(ans)

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

while(1):
    sqrtn=n**(1/2)
    if sqrtn-sqrtn//1==0:
        print(int(sqrtn**2))
        break
    n-=1

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

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

n = 1
while n * n <= N:
  ans = n * n
  n += 1

print(ans)

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools

def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())

def swap(s,pos):
    s[pos]-=1
    s[pos+1]+=1
    print(s)
    if pos == n-2: return s
    if s[pos+2] == 0: swap(s,pos+1)
    return s


n = ip()                              













a = math.sqrt(n)
print(pow(int(a),2))

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

ans = 0

for i in range(1, N + 1):
    if N < i * i:
        break
    ans = i * i

print(ans)

Solution (Python):


















import collections
import math


n = int(input())

for i in range(1, 1000000):
  a = i*i
  if a > n:
    print((i-1)*(i-1))
    break

Solution (Python):
N = int(input())
ans = 1
for i in range(1, N):
    if i*i <= N:
        ans = i*i
    else:
        break
print(ans)

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

Solution (Python):
import math

n = int(input())
for i in range(n, 0, -1):
    if math.sqrt(i).is_integer():
        print(i)
        exit(0)

Solution (Python):
n = int(input())
for i in range(2,n+2):
    if i**2 > n:
        print((i-1)**2)
        break

Solution (Python):
n = int(input())
if n == 1:
    print(1)
    exit()
else:
    for i in range(n+1):
        if i**2 > n:
            print((i-1)**2)
            exit()

Solution (Python):
import math
print(math.floor(math.sqrt(int(input())))**2)

Solution (Python):
import math
n=int(input())
almost=math.floor(math.sqrt(n))
ans=0
for i in range(almost,n+1):
    if i <= math.sqrt(n):
        ans=i**2
    else:
        break
print(ans)

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

Solution (Python):
N=int(input())
m=int(pow(N,1/2))
print(m*m)

Solution (Python):
n=int(input())
A=[i**2 for i in range(10**5)][::-1]
for i in A:
  if i<=n:
    print(i)
    exit()

Solution (Python):
lists = [i * i for i in range(4 * (10 ** 4))]
N = int(input())

back_state = 1
for i in lists:
    if i - N > 0:
        print(back_state)
        exit(0)
    back_state = i

Solution (Python):
import math

N=int(input())
ans=int(math.sqrt(N))**2

print(ans)

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

result = 0

for i in range(int_n + 1):
    if i ** 2 <= int_n:
        result = i**2
    else:
        break
print(result)

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

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

ans = 0
i   =  0
while ans<=n:
  i=i+1
  ans = i**2
  
print((i-1)**2)

Solution (Python):
import math
N = int(input())
n = int(math.sqrt(N))
print(n*n)

Solution (Python):
n=int(input())
i=1
ans=0
while True:
  tmp=i**2
  if tmp<=n:
    ans=tmp
  else:
    print(ans)
    exit()
  i+=1

Solution (Python):
N=int(input())
k=1
while k**2<=N:
  k+=1
if k**2<=N:
  print(k**2)
else:
  print((k-1)**2)

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

Solution (Python):
from math import sqrt
n = int(input())
for k in range(2, int(sqrt(n))+2):
    if k**2 > n:
        print((k-1)**2)
        break

Solution (Python):


import math


N = int( raw_input())
sqroot=int(math.sqrt(N))

print sqroot**2

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

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

for i in range(N):
  if (N**0.5).is_integer():
    print(N)
    break
  N = N - 1

Solution (Python):
N = int(input())
ans = int(N**(1/2))**2
print(ans)

Solution (Python):
a=int(input())
for i in range(100000000):
	if i*i==a:
		print(a)
		break
	elif i*i>a:
		print((i-1)*(i-1))
		break

Solution (Python):
n = int(input())
for i in range(1, n+1):
  ans = i*i
  if ans>=n:
    break
  tmp = ans
  
print(ans if ans==n else tmp)

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

    i = 1
    last = 1
    while True:
        r = i ** 2
        if r > n:
            print(last)
            break
        last = r
        i += 1



if __name__ == '__main__':
    main()

Solution (Python):
import math

N = int(input())

N_tmp = int(math.sqrt(N))
print(N_tmp ** 2)

Solution (Python):

import math
def getInt(): return int(input())
N = getInt()
for i in range(N,0,-1):
    
    sqr = int(math.sqrt(i))
    
    if i==sqr**2: break
print(i)

Solution (Python):
n = int(input())
i = 0
while True:
    i += 1
    if i**2 == n:
        print(i**2)
        break
    elif i**2 > n:
        print((i-1)**2)
        break

Solution (Python):


import math

n = int(input())

print(math.floor(math.sqrt(n))**2)

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

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

sq = int(N**(1/2))**2

print(sq)

Solution (Python):
import math
N = int(input())
for i in range(N,0,-1):
    if math.sqrt(i).is_integer():
        print(i)
        break

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

for i in range(1,n+2):
    if i**2>n:
        print((i-1)**2)
        break

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

mylist=[]
for i in range(31624):
    mylist.append(i**2)
ans=0    

for i in mylist:
    if i <= n:
        ans=i

print(ans)

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

if n == 1:
    print(1)

for i in range(1,n+1):
    if i**2>n:
        print((i-1)**2)
        break

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

Solution (Python):
from math import floor, sqrt

N = int(input())

print(floor(sqrt(N)) ** 2)

Solution (Python):
import math
n = int(input())
rt = math.sqrt(n)
fl = math.floor(rt)
print(fl * fl)

Solution (Python):
N = int(input())
print(int((N**0.5//1)**2))