def fibo(i):
  if i<=1:
    return i
  else:
    return fibo(i-2)+fibo(i-1)
for i in range(int(input())):
  print(fibo(i))

import math as m
def main():
  t=input().strip()
  for i in range(int(t)):
    print( format(m.sqrt(int(input())),'.2f'))
# Type your code here
main()

n=int(input())  
for i in range(2,n+1):  
    k=0  
    for j in range(2,i//2+1):  
        if(i%j==0):  
            k=k+1  
    if(k<=0):  
        print(i)

def primeFactors(n):
  global factors
  if(n==1):
    return
  elif((n%factors)== 0):
    print(factors)
    primeFactors(n//factors)
  else:
    factors+=1
    primeFactors(n)
factors = 2

def fibonacci(n):
  if(n==0 or n==1):
    return n
  else:
    return fibonacci(n-2)+fibonacci(n-1)
n=int(input())
for i in range(n-1,-1,-1):
  print(fibonacci(i))

def summation(n):
  if(n<1):
    return 0
  else:
    return (n%10)+summation(n//10)
t=int(input())
for i in range(1,t+1):
  n=int(input())
  print(summation(n))

n=input()
print(int(n[::-1]))

n=int(input())
def prime_factors(n,factors):
  if(n==1):
    return
  elif((n%factors)== 0):
    print(factors)
    prime_factors(n//factors,factors)
  else:
    prime_factors(n,factors+1)
prime_factors(n,2)

void partitionArray(int arr[], int n, int x)
{
  int i, j, temp;
  i = 0;
  j = n-1;
  
   while (i < j )
  {
    while (arr[i] <=x && i < j )
  
       i++;
    while (arr[j] > x  && i < j )
       j--;
  
    temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
	
    i++;
    j--;
  }  
}

int kthLargest(int arr[], int size, int k)
{
  int c,d,swap;
  for(c=0;c<size-1;c++) {
    for(d=0;d<size-c-1;d++) {
      if(arr[d]<arr[d+1]) {
        swap = arr[d];
        arr[d] = arr[d+1];
        arr[d+1] = swap;
      }
    }
  }
  return arr[k];
}

#include <limits.h>
#include <stdio.h>
void printlargest(int arr[], int arr_size)
{
	int i, first, second;
	if (arr_size < 2) {
		printf(" Invalid Input ");
		return;
	}
	first = second = INT_MIN;
	for (i = 0; i < arr_size; i++) {
		if (arr[i] > first) {
			second = first;
			first = arr[i];
		}
      else if (arr[i] > second && arr[i] != first)
			second = arr[i];
	}
	if (second == INT_MIN)
		printf("0");
	else
		printf("%d",second);
}
int main()
{
  	int i;
	int arr[5];
  	for(i=0;i<=5;i++){
      scanf("%d",&arr[i]);
    }
	int n = sizeof(arr) / sizeof(arr[0]);
	printlargest(arr, n);
	return 0;
}

void removeDuplicates(int *arr, int *size)
{
  int i,j;
  for(i = 0; i < *size; i++)
    {
        for(j = i + 1; j < *size; j++)
        {
                if(arr[i] == arr[j])
                {
                        for (int k = j; k < *size - 1; ++k)
                        {
                                arr[k] = arr[k + 1];
                        }
                        (*size)--;
                        j--;  
                }       
        }
}
}

#include 
using namespace std;
int findKSmallest(int arr[], int n, int k)
{
	int max = 0;
	for (int i = 0; i < n; i++)
	{
		if (arr[i] > max)
			max = arr[i];
	}
	int counter[max + 1] = { 0 };
	int smallest = 0;
	for (int i = 0; i < n; i++)
	{
		counter[arr[i]]++;
	}
	for (int num = 1; num <= max; num++)
	{
		if (counter[num] > 0) {
			smallest += counter[num];
		}
		if (smallest >= k)
		{
			return num;
		}
	}
}

def countWords(string):
	return(len(string.split()))

def strtokCode(str,delim):
  lis= str.split(delim)
  for i in lis:
      print(i)
def main():
  t = int(input())
  for i in range(t):
    string=input()
    arr=string.split();
    strtokCode(arr[0],arr[1])
    
	
if _name_ == "_main_":
  main()

first=input()
second=input()
if firstsecond:
  print("Large")
else:
  print("Equal")

def isRotation(string1,string2):
  string= string1+string1
  if(len(string1)==len(string2)):
    if string2 in string:
      return("YES")
    else:
      return(0)
  else:
    return(0)

#include <stdio.h>
/* Include other headers as needed */
int main()
{
    int T,N,K,A[1000],count=0;
    scanf("%d",&T);
    for(int i=0;i<T;i++)
    {
       printf("\n");
       count=0;
       scanf("%d %d",&N,&K);
       for(int j=0;j<N;j++)
       {
          scanf("%d",&A[j]);
       }
       for(int j=0;j<N;j++)
       {
          if(A[j]==K)
          {
            count=count+1;
          }
       }
       printf("%d",count);
    }

    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    return 0;
}

#include <stdio.h>
/* Include other headers as needed */
int main()
{
  int T,N,K,A[1000],count;
    scanf("%d",&T);
    for(int i=0;i<T;i++)
    {
       count=0;
       printf("\n");
       scanf("%d %d",&N,&K);
       for(int j=0;j<N;j++)
       {
          scanf("%d",&A[j]);
       }
       for(int j=0;j<N;j++)
       {
          if(A[j]==K)
          {
            count=0;
            printf("%d",j);
            break;
          }
          else{
            count=1;
          }
       }
       if(count==1)
       {
         printf("-1");
       }
    }


    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    return 0;
}

int rotationCount(int a[], int size)
{
  int count;
  count=0;
  for(int i=0;i<size;i++)
  {
    if(a[i]>a[i+1])
    {
      count=count+1;
      break;
    }
    else
    {
      count=count+1;
    }
    if(count==size)
    {
      count=-1;
    }
  }
  return(count);
}

int searchRotatedSortedArray(int *a, int size, int target)
{
  for(int i=0;i<size;i++)
  {
    if(a[i]==target)
    {
      return(i);
    }
  }
  return(-1);
}int searchRotatedSortedArray(int *a, int size, int target)
{
  for(int i=0;i<size;i++)
  {
    if(a[i]==target)
    {
      return(i);
    }
  }
  return(-1);
}

def isAnagram(string1,string2):
  if len(string1)!=len(string2):
    return 0
  string1 = sorted(string1)
  string2 = sorted(string2)
  for i in range(0, len(string1)):
    if string1[i] != string2[i]:
      return 0
  return("Yes")

#include <stdio.h>

int main()
{
   int arr1[100], fr1[100];
    int n, i, j, ctr;
       scanf("%d",&n);
       for(i=0;i<n;i++)
       {
	      scanf("%d",&arr1[i]);
		  fr1[i] = -1;
	    }
    for(i=0; i<n; i++)
    {
        ctr = 1;
        for(j=i+1; j<n; j++)
        {
            if(arr1[i]==arr1[j])
            {
                ctr++;
                fr1[j] = 0;
            }
        }

        if(fr1[i]!=0)
        {
            fr1[i] = ctr;
        }
    }
    for(i=0; i<n; i++)
    {
        if(fr1[i]!=0)
        {
            printf("%d occurs %d times\n", arr1[i], fr1[i]);
        }
    }
    
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    return 0;
}

#include<string.h>
char* reverseString(char *s)
{
   int len = strlen(s);  
   int i;  
  
   for(i=0;i<len;i++)  
        push(s[i]);  
  
   for(i=0;i<len;i++)  
        s[i]=pop(); 
   return(s);
}

void forwardPrint(struct Node* head)
{
	while(head != NULL)
  {
    cout << head->data << "-"; 
      head = head->next;
  }
}

void backwardPrint(struct Node* head)
{
	    struct Node *current, *prev, *next;
  		int array[1000],i=0;
        current = head;
        prev = NULL;
        while (current != NULL) {
          array[i] = current->data;
          i+=1;
          next = current->next;
          current->next = prev;
          prev = current;
          current = next;
        }
        head = prev;
       for(int j=i-1; j>=0; j--) {
         cout<<array[j]<<"-";
       }
}