#include<iostream>
#include<bits/stdc++.h>
using namespace std;
const int maxn=500001;
int c[maxn];

priority_queue<int> sq;
priority_queue<int,vector<int>,greater<int> > bq;

struct Node
{
	int v,index;
	bool operator < (const Node &b) const
	{
		return v<b.v; //??????
	}
}node[maxn];
int n;
void add(int i)
{
	while(i<=n)
	{
		c[i]++;
		i+=i&(-i);
	}
}
long long sum(int i)
{
	long long res=0;
	while(i>0)
	{
		res+=c[i];
		i-=i&(-i);
	}
	return res;
}

long long Abs(long long x)
{
	return x>0?x:-x;
}

int main()
{
	cin>>n;
	int a;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a);
		node[i].index=i;
		node[i].v=a;
	}
	sort(node+1,node+1+n);
	//for(int i=1;i<=n;i++) cout<<node[i].v<<' '<<node[i].index<<endl;
	long long ans=0,ans2=0,ans3=0,mid;
	int l=node[1].index,r=node[1].index;
	for(int i=1;i<=n;i++)
	{
		add(node[i].index);
		if(i==1) mid = node[i].index;
		else
		{
			if(node[i].index < mid) sq.push(node[i].index),ans3+=(mid-node[i].index);
			else bq.push(node[i].index),ans3+=(node[i].index - mid);

			//cout<<sq.size()<<' '<<bq.size()<<' ';

			if(sq.size() == bq.size()+2)
			{
				int t = mid - sq.top();//123 56 9/1 3/5
				ans3 -= sq.size() * (t);
				bq.push(mid);
				mid = sq.top();
				sq.pop();
				ans3 += bq.size() * (t);
			}
			else if(bq.size() == sq.size() +2)
			{
				int t = bq.top() - mid;//123 56 9/1 3/5
				//cout<<"T"<<t<<' ';
				ans3 -= bq.size() * (t);
				//cout<<ans3<<' ';
				sq.push(mid);
				mid = bq.top();
				bq.pop();
				ans3 += sq.size() * (t);

			//	cout<<sq.size()<<' '<<bq.size()<<' ';
			}
		}

		ans2+=i/2;
	//	cout<<ans3<<' '<<ans2<<' ';
		ans+=i-sum(node[i].index) ;
		//cout<<ans<<' ';
		cout<<ans + ans3 - ans2<<endl;
	}
	//cout<<ans;
	return 0;
}

/*
5
5 4 3 2 1

34512
34152
31452
13452
13425
13245
12345

3
1 2 3

3 4

0 1 5 7

*/


#include<iostream>
#include<bits/stdc++.h>
using namespace std;
const int maxn=500001;
int c[maxn];

priority_queue<int> sq,bq;

struct Node
{
	int v,index;
	bool operator < (const Node &b) const
	{
		return v<b.v; //??????
	}
}node[maxn];
int n;
void add(int i)
{
	while(i<=n)
	{
		c[i]++;
		i+=i&(-i);
	}
}
long long sum(int i)
{
	long long res=0;
	while(i>0)
	{
		res+=c[i];
		i-=i&(-i);
	}
	return res;
}

long long Abs(long long x)
{
	return x>0?x:-x;
}

int main()
{
	cin>>n;
	int a;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a);
		node[i].index=i;
		node[i].v=a;
	}
	sort(node+1,node+1+n);
	//for(int i=1;i<=n;i++) cout<<node[i].v<<' '<<node[i].index<<endl;
	long long ans=0,ans2=0,ans3=0,mid;
	int l=node[1].index,r=node[1].index;
	for(int i=1;i<=n;i++)
	{
		add(node[i].index);
		if(i==1) mid = node[i].index;
		else
		{
			if(node[i].index < mid) sq.push(node[i].index),ans3+=(mid-node[i].index);
			else bq.push(node[i].index),ans3+=(node[i].index - mid);

		//	cout<<sq.size()<<' '<<bq.size()<<' ';

			if(sq.size() == bq.size()+2)
			{
				int t = mid - sq.top();//123 56 9/1 3/5
				ans3 -= sq.size() * (t);
				bq.push(mid);
				mid = sq.top();
				sq.pop();
				ans3 += bq.size() * (t);
			}
			else if(bq.size() == sq.size() +2)
			{
				int t = mid - bq.top();//123 56 9/1 3/5
				ans3 -= bq.size() * (t);
				sq.push(mid);
				mid = bq.top();
				bq.pop();
				ans3 += sq.size() * (t);
			}
		}

		ans2+=i/2;
		//cout<<ans3<<' '<<ans2<<' ';
		ans+=i-sum(node[i].index) ;
		//cout<<ans<<' ';
		cout<<ans + ans3 - ans2<<' '<<endl;
	}
	//cout<<ans;
	return 0;
}

/*
5
5 4 3 2 1

34512
34152
31452
13452
13425
13245
12345

3 4

0 1 5 7

*/


#include<iostream>
#include<bits/stdc++.h>
using namespace std;
const int maxn=500001;
int c[maxn];

priority_queue<int> sq;
priority_queue<int,vector<int>,greater<int> > bq;

struct Node
{
	int v,index;
	bool operator < (const Node &b) const
	{
		return v<b.v;
	}
}node[maxn];
int n;
void add(int i)
{
	while(i<=n)
	{
		c[i]++;
		i+=i&(-i);
	}
}
long long sum(int i)
{
	long long res=0;
	while(i>0)
	{
		res+=c[i];
		i-=i&(-i);
	}
	return res;
}

long long Abs(long long x)
{
	return x>0?x:-x;
}

int main()
{
	cin>>n;
	int a;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a);
		node[i].index=i;
		node[i].v=a;
	}
	sort(node+1,node+1+n);

	long long ans=0,ans2=0,ans3=0,mid;
	int l=node[1].index,r=node[1].index;
	for(int i=1;i<=n;i++)
	{
		add(node[i].index);
		if(i==1) mid = node[i].index;
		else
		{
			if(node[i].index < mid) sq.push(node[i].index),ans3+=(mid-node[i].index);
			else bq.push(node[i].index),ans3+=(node[i].index - mid);

			if(sq.size() == bq.size()+2)
			{
				int t = mid - sq.top();
				ans3 -= sq.size() * (t);
				bq.push(mid);
				mid = sq.top();
				sq.pop();
				ans3 += bq.size() * (t);
			}
			else if(bq.size() == sq.size() +2)
			{
				int t = bq.top() - mid;
				ans3 -= bq.size() * (t);
				sq.push(mid);
				mid = bq.top();
				bq.pop();
				ans3 += sq.size() * (t);
			}
		}

		ans2+=i/2;
		ans+=i-sum(node[i].index) ;
		cout<<ans + ans3 - ans2<<endl;
	}
	return 0;
}


#include<bits/stdc++.h>
#define lowbit(x)  x&(-x)
#define dF(i,a,b) for(int i=a;i>=(b);--i)

using namespace std;

typedef long long ll;

const int maxn=2e5+10;

ll sum[maxn],a[maxn],c[maxn];
ll b1[maxn]; // 计算逆序数
ll b2[maxn]; // 聚合数字  //0101010 --> 0011100
ll n;

void add( ll *b ,ll x,ll p )
{
	for( ll i=x;i<=n;i+=lowbit(i) )
	{
		b[i]+=p;
	}
}

ll query( ll *b,ll x )
{
	int ans=0;
	for( ll i=x;i>0;i-=lowbit(i) )
	{
		ans+=b[i];
	}
	return ans;
}

ll get_mid( ll x )
{
	int l=0,r=n;
	while( l<=r )
	{
		int mid=(l+r)>>1;
		if( query(b1,mid)>=x )	r=mid-1;
		else l=mid+1;
	}
	return l;
}

 int bs(ll*b,ll x){
	int i=0;
	dF(j,19,0)if((i|1<<j)<=n){if(b[i|1<<j]<=x)x-=b[i|=1<<j];}
	return i;
}

int main()
{
	scanf("%lld",&n);
	for( int i=1;i<=n;i++ )
	{
		scanf("%d",&a[i]);
		c[a[i]]=i;
	}
	ll cnt=0;  // 序列 逆序数的值
	for( ll i=1;i<=n;i++ )
	{
		ll p=c[i];
		add(b1,p,1);
		cnt+=i-query(b1,p);
		add(b2,p,p);
		ll pos=bs(b1,i/2)+1; //中间数字位置
		ll sum=0;
		ll num1=i/2,num2=i-i/2-1;
	//	sum+=( query(b2,n)-query(b2,pos) ) -( query(b2,pos-1) );
	//	sum+=(ll)num1*( pos-1 + pos-num1 )/2-(ll)num2*( pos+1 + pos+num2 )/2;
		sum+=(ll)num1*pos-(ll)num1*(num1+1)/2-query(b2,pos-1);
		sum+=( query(b2,n)-query(b2,pos) )-(ll)num2*pos-num2*(num2+1)/2;
		printf("%lld ",cnt+sum);
	}

}


#include<bits/stdc++.h>
#define lowbit(x)  x&(-x)

using namespace std;

typedef long long ll;

const int maxn=2e5+10;

ll sum[maxn],a[maxn],b[maxn];
ll b1[maxn]; // 计算逆序数
ll b2[maxn]; // 聚合数字  //0101010 --> 0011100
int n;

void add( ll *c ,ll x,ll p )
{
	for( int i=x;i<=n;i+=lowbit(i) )
	{
		c[i]+=p;
	}
}

ll query( ll *c,ll x )
{
	int ans=0;
	for( int i=x;i>0;i-=lowbit(i) )
	{
		ans+=c[i];
	}
	return ans;
}

ll get_mid( ll x )
{
	int l=0,r=n;
	while( l<=r )
	{
		int mid=(l+r)>>1;
		if( query(b1,mid)>=x )	r=mid-1;
		else l=mid+1;
	}
	return l;
}

ll de( ll x,ll y )
{
	ll len=y-x+1;
	return (x+y)*len/2;
}

 int bs(ll*b,ll x){
	int i=0;
	for( int j=19;j>=0;j-- )if((i|1<<j)<=n){if(b[i|1<<j]<=x)x-=b[i|=1<<j];}
	return i;
}

int main()
{
	scanf("%lld",&n);
	for( int i=1;i<=n;i++ )
	{
		scanf("%d",&a[i]);
		b[a[i]]=i;
	}
	ll cnt=0;  // 序列 逆序数的值
	for( ll i=1;i<=n;i++ )
	{
		ll now=b[i];
		add(b1,now,1);
		cnt+=i-query(b1,now);
		ll pos=bs(b1,i/2)+1; //中间数字位置
		add(b2,now,now);
		ll sum=0;
		ll num1=i/2,num2=i-i/2-1;
	//	sum+=( query(b2,n)-query(b2,pos) ) -( query(b2,pos-1) );
	//	sum+=(ll)num1*( pos-1 + pos-num1 )/2-(ll)num2*( pos+1 + pos+num2 )/2;
		sum+=(ll)num1*pos-(ll)num1*(num1+1)/2-query(b2,pos-1);
		sum+=( query(b2,n)-query(b2,pos) )-(ll)num2*pos-num2*(num2+1)/2;
		printf("%lld ",cnt+sum);
	}

}


#include<bits/stdc++.h>
#define lowbit(x) x&(-x)
using namespace std;

typedef long long ll;
const int maxn=2e5+10;
int n;
int a[maxn],c[maxn];
ll b1[maxn],b2[maxn];

void add( ll *b ,ll x,ll p )
{
	for( ll i=x;i<=n;i+=lowbit(i) )
	{
		b[i]+=p;
	}
}

ll query( ll *b,ll x )
{
	ll ans=0;
	for( ll i=x;i>0;i-=lowbit(i) )
	{
		ans+=b[i];
	}
	return ans;
}

inline int bs(ll*b,ll x)
{
	int i=0;
	for( int j=19;j>=0;j-- ) if((i|1<<j)<=n){if(b[i|1<<j]<=x)x-=b[i|=1<<j];}
	return i;
}

int main(){
	scanf("%d",&n);
	for( int i=1;i<=n;i++ )scanf("%d",a+i),c[a[i]]=i;
	ll cnt=0;
	for( int i=1;i<=n;i++ )
	{
		int p=c[i];
		add(b1,p,1);
		cnt+=i-query(b1,p);
		add(b2,p,p);
		int pos=bs(b1,i/2)+1;
//		printf("%lld,%d\n",cnt,pos);
		ll sum=0;
		ll aa=i/2,bb=i-i/2-1;
		sum+=(ll)aa*pos-(ll)aa*(aa+1)/2-query(b2,pos-1);
		sum+=(query(b2,n)-query(b2,pos))-(ll)bb*pos-(ll)bb*(bb+1)/2;
		printf("%lld\n",sum+cnt);
	}
	return 0;
}


#include<bits/stdc++.h>
#define lowbit(x)  x&(-x)

using namespace std;

typedef long long ll;

const int maxn=2e5+10;

ll a[maxn],b[maxn];
ll b1[maxn]; // 计算逆序数
ll b2[maxn]; // 聚合数字  //0101010 --> 0011100
int n;

void add( ll *c ,ll x,ll p )
{
	for( int i=x;i<=n;i+=lowbit(i) )
	{
		c[i]+=p;
	}
}

ll query( ll *c,ll x )
{
	ll ans=0;
	for( int i=x;i>0;i-=lowbit(i) )
	{
		ans+=c[i];
	}
	return ans;
}

ll get_mid( ll x )
{
	int l=0,r=n;
	int ans=0;
	while( l<=r )
	{
		int mid=(l+r)>>1;
		if( query(b1,mid)>=x/2+1 )
		{
			ans=mid;
			r=mid-1;
		}
		else l=mid+1;
	}
	return ans;
}

int main()
{
	scanf("%d",&n);
	for( int i=1;i<=n;i++ )
	{
		scanf("%d",&a[i]);
		b[a[i]]=i;
	}
	ll cnt=0;  // 序列 逆序数的值
	for( ll i=1;i<=n;i++ )
	{
		ll now=b[i];
		add(b1,now,1);
		cnt+=i-query(b1,now);
		ll pos=get_mid(i); //中间数字位置
		add(b2,now,now);
		ll sum=0;
		ll num1=i/2,num2=i-i/2-1;
	//	sum+=( query(b2,n)-query(b2,pos) ) -( query(b2,pos-1) );
	//	sum+=(ll)num1*( pos-1 + pos-num1 )/2-(ll)num2*( pos+1 + pos+num2 )/2;
		sum+=(ll)num1*pos-(ll)num1*(num1+1)/2-query(b2,pos-1);
		sum+=( query(b2,n)-query(b2,pos) )-(ll)num2*pos-num2*(num2+1)/2;
		printf("%lld ",cnt+sum);
	}

}

//1 2 3 4 5


import sys
import math
# range = xrange
# input = raw_input

a = input()
b = input()
if len(a) < len(b):
	print('<')
elif len(b) < len(a):
	print('>')
elif a < b:
	print ('<')
elif a == b:
	print ('=')
else:
	print ('>')


import sys
import math
# range = xrange
# input = raw_input

a = input()
ind = 0
while ind < len(a) and a[ind] == '0':
	ind += 1
a = a[ind:]
b = input()
ind = 0
while ind < len(b) and b[ind] == '0':
	ind += 1
b = b[ind:]
if len(a) < len(b):
	print('<')
elif len(b) < len(a):
	print('>')
elif a < b:
	print ('<')
elif a == b:
	print ('=')
else:
	print ('>')


a=input()
b=input()
if(int(a)==int(b)):
    print("=")
elif (int(a)>int(b)):
    print(">")
else:
    print("<")


n = input()
m = input()
l = max(len(n), len(m))
dn = len(n) - l
dm = len(m) - l
for i in range(l):
    vn = '0'
    if dn + i >= 0:
        vn = n[dn + i]
    vm = '0'
    if dm + i >= 0:
        vm = m[dm + i]
    if vn < vm:
        print("<")
        exit(0)
    else:
        if vn > vm:
            print(">")
            exit(0)
print("=")


s, a = str(input()), str(input())
if s.lstrip('0') == a.lstrip('0') : print('=')
elif  s.lstrip('0') > a.lstrip('0') : print('>')
else : print('<')


a = input().lstrip("0")
b = input().lstrip("0")

if len(a) < len(b):
    print('<')
elif len(a) > len(b):
    print('>')
else:
    for i in range(len(a)):
        if a[i] < b[i]:
            print('<')
            exit()
        elif a[i] > b[i]:
            print('>')
            exit()
    print('=')


s, a = str(input()), str(input())
if s.lstrip('0') == a.lstrip('0') : print('=')
elif  int(s.lstrip('0')) > int(a.lstrip('0')) : print('>')
else : print('<')


def trim(s):
    if s == '':
        return s

    if s[0] != '0':
        return s

    stop = 0
    for i in range(len(s)):
        if s[i] != '0':
            stop = i
            break

    if stop == 0:
        return ''

    return s[stop:]

a = trim(input())
b = trim(input())

print(a, b)

answer = ''
if len(a) > len(b):
    answer = '>'

if len(a) < len(b):
    answer = '<'

if answer == '':
    for i in range(len(a)):
        if a[i] == b[i]:
            continue

        if int(a[i]) > int(b[i]):
            answer = ">"
        else:
            answer = "<"

        break

if answer == '':
    answer = '='

print(answer)


def trim(s):
    if s == '':
        return s

    if s[0] != '0':
        return s

    stop = 0
    for i in range(len(s)):
        if s[i] != '0':
            stop = i
            break

    return s[stop:]

a = trim(input())
b = trim(input())

print(a, b)

answer = ''
if len(a) > len(b):
    answer = '>'

if len(a) < len(b):
    answer = '<'

if answer == '':
    for i in range(len(a)):
        if a[i] == b[i]:
            continue

        if int(a[i]) > int(b[i]):
            answer = ">"
        else:
            answer = "<"

        break

if answer == '':
    answer = '='

print(answer)


def trim(s):
    if s == '':
        return s

    if s[0] != '0':
        return s

    stop = 0
    for i in range(len(s)):
        if s[i] != '0':
            stop = i
            break

    return s[stop:]

a = trim(input())
b = trim(input())

# print(a, b)

answer = ''
if len(a) > len(b):
    answer = '>'

if len(a) < len(b):
    answer = '<'

if answer == '':
    for i in range(len(a)):
        if a[i] == b[i]:
            continue

        if int(a[i]) > int(b[i]):
            answer = ">"
        else:
            answer = "<"

        break

if answer == '':
    answer = '='

print(answer)


def trim(s):
    if s == '':
        return s

    if s[0] != '0':
        return s

    stop = 0
    for i in range(len(s)):
        if s[i] != '0':
            stop = i
            break

    if stop == 0:
        return ''

    return s[stop:]

a = trim(input())
b = trim(input())

# print(a, b)

answer = ''
if len(a) > len(b):
    answer = '>'

if len(a) < len(b):
    answer = '<'

if answer == '':
    for i in range(len(a)):
        if a[i] == b[i]:
            continue

        if int(a[i]) > int(b[i]):
            answer = ">"
        else:
            answer = "<"

        break

if answer == '':
    answer = '='

print(answer)


def trim(s):
    if s == '':
        return ''

    if s[0] != '0':
        return s

    return trim(s[1:])

a = trim(input())
b = trim(input())

answer = ''
if len(a) > len(b):
    answer = '>'

if len(a) < len(b):
    answer = '<'

if answer == '':
    for i in range(len(a)):
        if a[i] == b[i]:
            continue

        if int(a[i]) > int(b[i]):
            answer = ">"
        else:
            answer = "<"

        break

if answer == '':
    answer = '='

print(answer)


a = input()
b = input()
na = len(a)
nb = len(b)
a = "0"*(max(na,nb)-na)+a
b = "0"*(max(na,nb)-nb)+b
if a == b:
    print("=")
elif a > b:
    print(">")
else:
    print("<")


import sys
a = sys.stdin.buffer.readline().decode('utf-8').rstrip()
b = sys.stdin.buffer.readline().decode('utf-8').rstrip()

n, m = len(a), len(b)
i, j = 0, 0
while i < n and a[i] == '0':
    i += 1
while j < m and b[j] == '0':
    j += 1

if n - i != m - j:
    print('<' if n-i < m-j else '>')
    exit()

while i < n:
    if a[i] < b[j]:
        print('<')
        break
    if a[i] > b[j]:
        print('>')
        break
    i += 1
    j += 1
else:
    print('=')


import sys
a = int(sys.stdin.buffer.readline().decode('utf-8').rstrip())
b = int(sys.stdin.buffer.readline().decode('utf-8').rstrip())

print('=' if a == b else '<' if a < b else '>')


A = input()
B = input()
a = min(A.find(str(i)) % len(A) for i in range(1, 10))
b = min(B.find(str(i)) % len(B) for i in range(1, 10))
A, B = A[a:], B[b:]
if len(A) < len(B):
    print('<')
elif len(A) > len(B):
    print('>')
else:
    for i in range(len(A)):
        if ord(A[i]) < ord(B[i]):
            print('<')
            break
        elif ord(A[i]) > ord(B[i]):
            print('>')
            break
    else:
        print('=')


a = input()
b = input()
if a < b:
    print '<'
elif a > b:
    print '>'
else:
    print '='


first = list(reversed(input()))
second = list(reversed(input()))

mx = max(len(first), len(second))

while len(first) < mx:
    first.append('0')

while len(second) < mx:
    second.append('0')

first.reverse()
second.reverse()

if first == second:
    print('=')
elif first > second:
    print('>')
else:
    print('<')


a=input().lstrip('0')
b=input().lstrip('0')
#print(a,b)
len1=len(a);len2=len(b)
#print(len1,len2)
if len1==len2:
    if (a>b):
        print('>')
    elif a<b:
        print('<')
    else:
        print('=')
else:
    if (len1>len2):
        print('>')
    else:
        print('<')


#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Tue Jun 23 12:22:19 2020

@author: shailesh
"""

s1 = int(input())
s2 = int(input())

if s1 == s2:
    print('=')
elif s1 > s2:
    print('>')
else:
    print('=')


#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Tue Jun 23 12:22:19 2020

@author: shailesh
"""

s1 = input()
s2 = input()
s1_len = len(s1)
s2_len = len(s2)

for i in range(s1_len):
    if s1[i] != '0':
        break
s1 = s1[i:]
s1_len -= i+1
for i in range(s2_len):
    if s2[i] != '0':
        break

s2 = s2[i:]
s2_len -= i+1

if s1_len > s2_len:
    print('>')
elif s2_len>s1_len:
    print('<')

else:
    for i in range(s1_len):
        if s1[i] != s2[i]:
            break
    if i == s1_len -1 and s1[i] == s2[i]:
        print('=')
    elif int(s1[i]) > int(s2[i]):
        print('>')
    else:
        print('<')


#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Tue Jun 23 12:22:19 2020

@author: shailesh
"""

s1 = input()
s2 = input()
s1_len = len(s1)
s2_len = len(s2)

for i in range(s1_len):
    if s1[i] != '0':
        break
s1 = s1[i:]
s1_len -= i
for i in range(s2_len):
    if s2[i] != '0':
        break

s2 = s2[i:]
s2_len -= i

if s1_len > s2_len:
    print('>')
elif s2_len>s1_len:
    print('<')

else:
    for i in range(s1_len):
        if s1[i] != s2[i]:
            break
    if i == s1_len -1 and s1[i] == s2[i]:
        print('=')
    elif int(s1[i]) > int(s2[i]):
        print('>')
    else:
        print('<')


#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Tue Jun 23 12:22:19 2020

@author: shailesh
"""

s1 = int(input())
s2 = int(input())

if s1 == s2:
    print('=')
elif s1 > s2:
    print('>')
else:
    print('<')


a, b = input(), input()
size = max(len(a), len(b))
a = a.zfill(size)
b = b.zfill(size)
if a < b:
  print('<')
elif a == b:
  print('=')
else:
  print('>')


a, b = int(input()), int(input())
if a < b:
  print('<')
elif a == b:
  print('=')
else:
  print('>')


a = input()
b = input()
acount,bcount = 0,0
for i in a:
    if i == '0':
        acount += 1
    else:
        break
for i in b:
    if i == '0':
        bcount += 1
    else:
        break
a = a.replace('0','',acount)
b = b.replace('0','',bcount)
if len(a) == len(b):
    for i, j in zip(a, b):
        if i > j:
            print(">")
            exit()
        elif i < j:
            print("<")
            exit()
    print("=")
elif len(a) > len(b):
    print(">")
else:
    print("<")


a = input()
b = input()
for i in a:
    if i != '0':
        break
    else:
        a = a.replace('0', '', 1)
for i in b:
    if i != '0':
        break
    else:
        b = b.replace('0', '', 1)
if len(a) == len(b):
    for i, j in zip(a, b):
        if i > j:
            print(">")
            exit()
        elif i < j:
            print("<")
            exit()
    print("=")
elif len(a) > len(b):
    print(">")
else:
    print("<")


a = input()
b = input()
acount,bcount = 0,0
for i in a:
    if i == '0':
        acount+=1
for i in b:
    if i == '0':
        bcount+=1
a = a.replace('0','',acount)
b = b.replace('0','',bcount)
if len(a) == len(b):
    for i, j in zip(a, b):
        if i > j:
            print(">")
            exit()
        elif i < j:
            print("<")
            exit()
    print("=")
elif len(a) > len(b):
    print(">")
else:
    print("<")


a = input()
b = input()
for i in a:
    if i != '0':
        break
    else:
        a = a.replace('0', '', 1)
for i in b:
    if i != '0':
        break
    else:
        b = b.replace('0', '', 1)
if len(a) == len(b):
    print("=")
elif len(a) > len(b):
    print(">")
else:
    print("<")


a=input()
b=input()
flag=1
flag1=1
i=0
i1=0
count=0
count1=0
while flag==1:
 if a[i]==0:
  i+=1
  count+=1
 else:
  flag=0
while flag1==1:
 if a[i1]==0:
  i1+=1
  count1+=1
 else:
  flag1=0
a=a[i:]
b=b[i1:]
if len(a)==len(b):
 if int(a[0])>int(b[0]):
  print(">")
 elif int(a[0])<int(b[0]):
  print("<")
 else:
  print("=")
else:
 if len(a)>len(b):
  print(">")
 else:
  print("<")


a=input()
b=input()
flag=1
flag1=1
i=0
i1=0
count=0
count1=0
while flag==1:
 if a[i]==0:
  i+=1
  count+=1
 else:
  flag=0
while flag1==1:
 if a[i1]==0:
  i1+=1
  count1+=1
 else:
  flag1=0
a=int(a[i:])
b=int(b[i1:])
if a[0]<b[0]:
 print("<")
elif a[0]>b[0]:
 print(">")
else:
 print("=")


a=input()
b=input()
flag=1
flag1=1
i=0
i1=0
count=0
count1=0
while flag==1:
 if a[i]==0:
  i+=1
  count+=1
 else:
  flag=0
while flag1==1:
 if a[i1]==0:
  i1+=1
  count1+=1
 else:
  flag1=0
a=int(a[i:])
b=int(b[i1:])
if a==b:
 print("=")
elif a>b:
 print(">")
else:
 print("<")


a=input().lstrip('0')
b=input().lstrip('0')
if(len(a)>len(b)):
    print('>')
elif(len(a)<len(b)):
    print('<')
else:
    if(a>b):
        print('>')
    elif(a<b):
        print('<')
    else:
        print('=')


#!/usr/bin/env python3

import re

try:
    rx = re.compile(r"^0+")
    while True:
        a = rx.sub("", input())
        b = rx.sub("", input())
        print('=' if a == b else '<' if int(a) < int(b) else '>')

except EOFError:
    pass


#!/usr/bin/env python3

try:
    while True:
        a = input().lstrip("0")
        b = input().lstrip("0")
        if not a:
            a = "0"
        if not b:
            b = "0"
        if len(a) < len(b):
            print('<')
        elif len(a) > len(b):
            print('>')
        else:
            for c, d in zip(a, b):
                if c != d:
                    print('<' if c < d else '>')
                    break
            else:
                print('=')

except EOFError:
    pass


n = input()
m = input()
l = max(len(n), len(m))
dn = len(n) - l
dm = len(m) - l
for i in range(l):
    vn = '0'
    if dn + i >= 0:
        vn = n[dn + i]
    vm = '0'
    if dm + i >= 0:
        vm = m[dm + i]
    if vn < vm:
        print("<")
        exit(0)
    else:
        if vn > vm:
            print(">")
            exit(0)
print("=")


a = int(input())
b = int(input())

if a<b:
    print("<")
elif a > b:
    print(">")
else:
    print("=")


import sys
a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()
acnt=0
bcnt=0
for data in a:
    if data =="0":
        acnt = acnt + 1
    else:
        break
for data in b:
    if data =="0":
        bcnt = bcnt + 1
    else:
        break

#print(acnt,bcnt)
#print(a[acnt::],b[bcnt::])
if a>b:
    print("<")
elif a < b:
    print(">")
else:
    print("=")


import sys
a = int(sys.stdin.readline().strip())
b = int(sys.stdin.readline().strip())

if a<b:
    print("<")
elif a > b:
    print(">")
else:
    print("=")


import sys
a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()
acnt=0
bcnt=0
for data in a:
    if data =="0":
        acnt = acnt + 1
    else:
        break
for data in b:
    if data =="0":
        bcnt = bcnt + 1
    else:
        break

#print(acnt,bcnt)
#print(a[acnt::],b[bcnt::])
a= a[acnt::]
b = b[bcnt::]
if len(a) > len(b):
    print(">")
elif len(a) < len(b):
    print("<")
else:
    if a<b:
        print("<")
    elif a > b:
        print(">")
    else:
        print("=")


import sys
a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()
acnt=0
bcnt=0
for data in a:
    if data =="0":
        acnt = acnt + 1
    else:
        break
for data in b:
    if data =="0":
        bcnt = bcnt + 1
    else:
        break

#print(acnt,bcnt)
#print(a[acnt::],b[bcnt::])
if len(a) > len(b):
    print(">")
elif len(a) < len(b):
    print("<")
else:
    if a<b:
        print("<")
    elif a > b:
        print(">")
    else:
        print("=")


import sys
a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()
acnt=0
bcnt=0
for data in a:
    if data =="0":
        acnt = acnt + 1
    else:
        break
for data in b:
    if data =="0":
        bcnt = bcnt + 1
    else:
        break

#print(acnt,bcnt)
#print(a[acnt::],b[bcnt::])
a= a[acnt::]
b = b[bcnt::]

if a<b:
    print("<")
elif a > b:
    print(">")
else:
    print("=")


import sys
a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()
acnt=0
bcnt=0
for data in a:
    if data =="0":
        acnt = acnt + 1
    else:
        break
for data in b:
    if data =="0":
        bcnt = bcnt + 1
    else:
        break

#print(acnt,bcnt)
#print(a[acnt::],b[bcnt::])
if a<b:
    print("<")
elif a > b:
    print(">")
else:
    print("=")


import sys
a = sys.stdin.readline().strip().replace("0","")
b = sys.stdin.readline().strip().replace("0","")

if a<b:
    print("<")
elif a > b:
    print(">")
else:
    print("=")


a = int(input())
b = int(input())

if a < b:
	print("<")
elif a > b:
	print(">")
else:
	print("=")


a = int(raw_input())
b = int(raw_input())

if a < b:
	print("<")
elif a > b:
	print(">")
else:
	print("=")


from sys import stdin, stdout

a = stdin.readline()
b = stdin.readline()

pos = 0
while pos < len(a) and a[pos] == '0':
	pos += 1

a = a[pos:]

pos = 0
while pos < len(b) and b[pos] == '0':
	pos += 1

if a < b:
	print("<")
elif a > b:
	print(">")
else:
	print("=")


from sys import stdin, stdout

a = input()
b = input()

# print(len(a), len(b))
if len(b) < len(a):
	b = "0" * (len(a) - len(b)) + b
else:
	a = "0" * (len(b) - len(a)) + a

# print(a, b)
if a < b:
	print("<")
elif a > b:
	print(">")
else:
	print("=")


a = input()
b = input()
if len(a) > len(b):
    a, b = b, a
a = '0' * (len(b)-len(a)) + a
if a == b:
    print("=")
    quit()
if a < b:
    print("<")
    quit()
print(">")


a=int(input());b=int(input());
if a==b:
    print("=")
    quit()
if a<b:
    print("<")
    quit()
print(">")


a = input()
b = input()
swap = 0
ans = ['<', '>']
if len(a) > len(b):
    a, b = b, a
    swap = 1
a = '0' * (len(b)-len(a)) + a
if a == b:
    print("=")
    quit()
if a < b:
    print(ans[swap])
    quit()
print(ans[1-swap])


    a=int(input())
    b=int(input())
    if (a>b):
        print(">")
    elif (b>a):
        print("<")
    else:
        print("=")


a=int(input())
b=int(input())
if (a>b):
    print(">")
elif (b>a):
    print("<")
else:
    print("=")


a=int(input())
b=int(input())
if (a>b) print(">")
elif (b>a) print("<")
else print("=")


from sys import stdin
a=stdin.readline()
b=stdin.readline()
if (len(a)>len(b)):
    b=(len(a)-len(b))*'0'+b;
else:
    a=(len(b)-len(a))*'0'+a;
if (a>b):
    print(">")
elif (b>a):
    print("<")
else:
    print("=")


a, b = input(), input()
if (len(a)>len(b)):
    b=(len(a)-len(b))*'0'+b;
else:
    a=(len(b)-len(a))*'0'+a;
if (a>b):
    print(">")
elif (b>a):
    print("<")
else:
    print("=")


from sys import stdin
a=int(stdin.readline())
b=int(stdin.readline())
if (a>b):
    print(">")
elif (b>a):
    print("<")
else:
    print("=")


import sys
a=int(stdin.readline())
b=int(stdin.readline())
if (a>b):
    print(">")
elif (b>a):
    print("<")
else:
    print("=")


a = input()
b = input()

while a[0] == '0':
    a = a.replace(a[0] , '')
while b[0] == '0' :
    b = b.replace(b[0] , '')

if int(a) > int(b):
    print('>')

elif int(a) < int(b):
    print('<')

else:
    print('=')


a = input()
b = input()

if len(a) > len(b):
    b = '0' * (len(a) - len(b)) + b

else:
    a = '0' * (len(b) - len(a)) + a

if a > b :
    print('>')

elif b > a :
    print('<')

else:
    print('=')


s1 , s2 = input() , input()
index1 , index2 = 0 , 0

for i,j in enumerate(s1):
    if j is not '0':
        break
    else:
        index1+=1

for i,j in enumerate(s2):
    if j is not '0' :
        break
    else :
        index2+=1

s1=s1[index1:]
s2=s2[index2:]

if len(s1) > len(s2): print('>')

elif len(s1) < len(s2): print('<')

else :

    for i in zip(s1,s2):
        if i[0] > i[1]:
            print('>')
            quit()
        elif i[0] < i[1]:
            print('<')
            quit()

    print('=')


s1 , s2 = input() , input()
index1 , index2 = 0 , 0

for i,j in enumerate(s1):
    if j is not '0':
        index1 = i
        break

for i,j in enumerate(s2):
    if j is not '0':
        index2 = i
        break

s1=s1[index1:]
s2=s2[index2:]

if len(s1) > len(s2): print('>')

elif len(s1) < len(s2): print('<')

else :

    for i in zip(s1,s2):
        if i[0] > i[1]:
            print('>')
            quit()
        elif i[0] < i[1]:
            print('<')
            quit()

    print('=')


import io
import os
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

x=int(input())
y=int(input())
if(x>y):
    print('>')
elif(y>x):
    print('<')
else:
    print('=')


x=input()
y=input()
if(len(x)>len(y)):
    y='0'*(len(x)-len(y))+y
elif(len(y)>len(x)):
    x='0'*(len(y)-len(x))+x
if(x>y):
    print('>')
elif(y>x):
    print('<')
else:
    print('=')


x=int(input())
y=int(input())
if(x>y):
    print('>')
elif(y>x):
    print('<')
else:
    print('=')


import sys

a = input().lstrip('0')
b = input().lstrip('0')

la = len(a)
lb = len(b)

if la == lb:
    i = 0
    while i < la and a[i] == b[i]:
        i += 1

    if i == la:
        print('=')
    elif a[i] > b[i]:
        print('>')
    else:
        print('<')
elif la > lb:
    print('>')
else:
    print('<')


import sys

a = input()
b = input()
na = al = len(a)
nb = bl = len(b)

i = 0
while a[i] == '0':
    i += 1
al -= i
j = 0
while b[j] == '0':
    j += 1
bl -= j

if al == bl:
    k = 0
    while  i+k < na  and j+k < nb and  (a[i+k] == b[j+k]):
        k += 1

    if i+k == na or j+k == nb:
        print('=')
    elif a[j] < b[j]:
        print('<')
    else:
        print('>')
elif al < bl:
    print('<')
else:
    print('>')


import sys

a = int(input())
b = int(input())

if a < b:
    print('<')
elif a > b:
    print('>')
else:
    print('=')


a = int(input())
b = int(input())
if a > b :
    print(">")
if a<b :
    print("<")
else :
    print("=")


a = int(input())
b = int(input())
if a > b :
    print(">")
if a<b :
    print("<")
if a == b :
    print("=")


def paddingleadingzeroes(s,t):
	if(len(s)==len(t)):
		return (s,t)
	else:
		if(len(s)>len(t)):
			b='0'*(len(s)-len(t))+t
			return (s,b)
		else:
			b='0'*(len(t)-len(s))+s
			return (b,t)

a=str(input())
b=str(input())

(c,d)=paddingleadingzeroes(a,b)
if(c>d):
	print('>')
elif(c<d):
	print('<')
else:
	print('=')


def removingleadingzeroes(s):
	if(s[0]=='0'):
		i=0
		while(s[i]!='0'):
			i+=1
		t=s[i:]
		return t
	else:
		return s

a=str(input())
b=str(input())

c=removingleadingzeroes(a)
d=removingleadingzeroes(b)
print(max(c,d))


def reduc(s):
    flag = True
    i = 0
    while i < len(s):
        if flag:
            if s[i] != '0':
                flag = False
                truei = i
                i = len(s)
            else:
                i += 1
        else:
            i = len(s)
    return s[truei:]

s = str(input())
t = str(input())

s = reduc(s)
t = reduc(t)

if len(s) > len(t):
    print(">")
elif len(s) < len(t):
    print("<")
else:
    flag = True
    i = 0
    while flag and i < len(s):
        if s[i] > t[i]:
            print(">")
            flag = False
        elif s[i]< t[i]:
            print("<")
            flag = False
        else:
            i += 1
    if flag:
        print("=")


def reduc(s):
    flag = True
    i = 0
    while i < len(s):
        if flag:
            if s[i] != '0':
                flag = False
                truei = i
                i = len(s)
            else:
                i += 1
        else:
            i = len(s)
    try:
        return s[truei:]
    except:
        return '0'

s = str(input())
t = str(input())

s = reduc(s)
t = reduc(t)

if len(s) > len(t):
    print(">")
elif len(s) < len(t):
    print("<")
else:
    flag = True
    i = 0
    while flag and i < len(s):
        if s[i] > t[i]:
            print(">")
            flag = False
        elif s[i]< t[i]:
            print("<")
            flag = False
        else:
            i += 1
    if flag:
        print("=")


a = input().lstrip('0')
b = input().lstrip('0')
ans = '='
if len(a) > len(b):
    ans = '>'
elif len(a) < len(b):
    ans = '<'
else:
    for i in range(len(a)):
        if int(a[i]) > int(b[i]):
            ans = '>'
        elif int(a[i]) < int(b[i]):
            ans = '<'
print(ans)


a = input().lstrip('0')
b = input().lstrip('0')
ans = '='
if len(a) > len(b):
    ans = '>'
elif len(a) < len(b):
    ans = '<'
else:
    for i in range(len(a)):
        if int(a[i]) > int(b[i]):
            ans = '>'
            break
        elif int(a[i]) < int(b[i]):
            ans = '<'
            break
print(ans)


import sys,io,atexit
input=sys.stdin.buffer.readline
sys.stdout = io.StringIO()
atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
inst=lambda: input().decode().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


import sys
input=sys.stdin.readline
a='0'+input().rstrip()
b='0'+input()
na=''
nb=''
flag=False
for i in a:
    if flag: na+=i
    elif i!='0':
        flag=True;na+=i
flag=False
for i in b:
    if flag:
        nb+=i
    elif i!='0':
        flag=True;nb+=i
print(na)
print(nb)
if len(na)<len(nb):
    print('<')
elif len(na)>len(nb):
    print('>')
else:
    ans='='
    for i in range(len(na)):
        if int(na[i])<int(nb[i]):
            ans='<'
            break
        elif int(na[i])>int(nb[i]):
            ans='>'
            break
        else:
            pass
    print(ans)


import sys
inst=lambda: sys.stdin.readline().rstrip('\n\r')
inin=lambda: int(sys.stdin.buffer.readline())
inar=lambda: list(map(int,sys.stdin.buffer.readline().split()))
a=input().lstrip('0')
b=input().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


'''import sys
input=sys.stdin.buffer.readline'''
import sys
input=sys.stdin.buffer.readline
#print= lambda _: sys.stdout.write(_+'\n')
inst=lambda: input().decode().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


import sys
input=sys.stdin.readline
inst=lambda: input().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


a=int(input())
b=int(input())
if a<b:
    print('<')
elif a>b:
    print('>')
else:
    print('=')


import sys
inst=lambda: sys.stdin.buffer.readline().decode().rstrip('\n\r')
inin=lambda: int(sys.stdin.buffer.readline())
inar=lambda: list(map(int,sys.stdin.buffer.readline().split()))
a=+inst().lstrip('0')
b='0'+inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


a=input()
b=input()
if a<b:
    print('<')
elif b<a:
    print('>')
else:
    print('=')


import sys
inst=lambda: sys.stdin.readline().rstrip('\n\r')
inin=lambda: int(sys.stdin.buffer.readline())
inar=lambda: list(map(int,sys.stdin.buffer.readline().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


import sys
from io import StringIO as stream
sys.stdin = stream(sys.stdin.read())
input = lambda: sys.stdin.readline().rstrip('\r\n')
inst=lambda: input().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


import sys
input=sys.stdin.buffer.readline
print= lambda _: sys.stdout.write(_+'\n')
inst=lambda: input().decode().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


import sys
input=sys.stdin.buffer.readline
print= lambda _,end='\n': sys.stdout.write(str(_)+end)
inst=lambda: input().decode().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


'''import sys
input=sys.stdin.buffer.readline
from collections import deque as que, defaultdict as vector, Counter
from bisect import bisect as bsearch
from heapq import*
inin = lambda: int(input())
inar = lambda: list(map(int,input().split()))
inst= lambda: input().decode().rstrip('\n\r')
INF=float('inf')'''
'''from types import GeneratorType
def recursive(f, stack=[]):
    def wrappedfunc(*args, **kwargs):
        if stack:
            return f(*args, **kwargs)
        else:
            to = f(*args, **kwargs)
            while True:
                if type(to) is GeneratorType:
                    stack.append(to)
                    to = next(to)
                else:
                    stack.pop()
                    if not stack:
                        break
                    to = stack[-1].send(to)
            return to
    return wrappedfunc'''
'''

_T_=inin()
for _t_ in range(_T_):
    n,m=inar()
    belt=[]
    for i in range(n):
        belt.append(inst())
    cnt=0
    for i in range(n-1):
        if belt[i][m-1]=='R':
            cnt+=1
    for j in range(m-1):
        if belt[n-1][j]=='D':
            cnt+=1
    print(cnt)'''

import sys
input=sys.stdin.buffer.readline
inst=lambda: input().decode().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


import io,os
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
#so many comments
#so many comments
#so many comments
inst=lambda: input().decode().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


import sys
input=sys.stdin.readline
a=input()
b=input()
na=''
nb=''
flag=False
for i in a:
    if i!='0':
        flag=True
    if not flag:
        if i!='0':
            na+=i
    else:
        na+=i
flag=False
for i in b:
    if i!='0':
        flag=True
    if not flag:
        if i!='0':
            nb+=i
    else:
        nb+=i
if len(na)<len(nb):
    print('<')
elif len(na)>len(nb):
    print('>')
else:
    ans='='
    for i in range(len(na)):
        if int(na[i])<int(nb[i]):
            ans='<'
            break
        elif int(na[i])>int(nb[i]):
            ans='>'
            break
        else:
            pass
    print(ans)


import sys
input=sys.stdin.buffer.readline
a=int(input())
b=int(input())
if a<b:
    print('<')
elif a>b:
    print('>')
else:
    print('=')


import sys
input=sys.stdin.readline
a='0'+input().rstrip()
b='0'+input().rstrip()
na=''
nb=''
flag=False
for i in a:
    if flag: na+=i
    elif i!='0':
        flag=True;na+=i
flag=False
for i in b:
    if flag:
        nb+=i
    elif i!='0':
        flag=True;nb+=i
if len(na)<len(nb):
    print('<')
elif len(na)>len(nb):
    print('>')
else:
    ans='='
    for i in range(len(na)):
        if int(na[i])<int(nb[i]):
            ans='<'
            break
        elif int(na[i])>int(nb[i]):
            ans='>'
            break
        else:
            pass
    print(ans)


import sys
input=sys.stdin.buffer.readline
#print= lambda _: sys.stdout.write(_+'\n')
inst=lambda: input().decode().rstrip('\n\r')
inin=lambda: int(input())
inar=lambda: list(map(int,input().split()))
a=inst().lstrip('0')
b=inst().lstrip('0')
if len(a)<len(b):
    print('<')
elif len(a)>len(b):
    print('>')
else:
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')


import java.io.*;
import java.util.*;

public class Solution {
	//fast scanner template
	static class FastScanner {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");

		String next() {
			while (!st.hasMoreTokens())
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long[] readArrayLong(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		int[] readArrayInt(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		long nextLong() {
			return Long.parseLong(next());
		}
	}
	//sorting template
	static void sortLong(long[] a) {
		ArrayList<Long> l = new ArrayList<>();
		for (long i : a)
			l.add(i);
		Collections.sort(l);
		for (int i = 0; i < a.length; i++)
			a[i] = l.get(i);
	}

	static void sortInt(int[] a) {
		ArrayList<Integer> l = new ArrayList<>();
		for (int i : a)
			l.add(i);
		Collections.sort(l);
		for (int i = 0; i < a.length; i++)
			a[i] = l.get(i);
	}

	//main code
	public static void main(String[] args) throws IOException {
		FastScanner fs = new FastScanner();
		int t = fs.nextInt();
		StringBuilder res = new StringBuilder();
		while (t-- > 0) {
			int n = fs.nextInt();
			int count = 0;
			for (int i = 4*n; i >= 1; i -= 2) {
				if (count >= n)
					break;
				res.append(i).append(" ");
				count++;
			}
			res.append("\n");
		}
		System.out.println(res);
	}
}


import java.util.ArrayList;
import java.util.Scanner;

public class KidSeating {
    private static Scanner scanner=new Scanner(System.in);
    public static void main(String[] args){
        int test=scanner.nextInt();
        for(int t=0;t<test;t++){
            int size=scanner.nextInt();
            int num=2*size;
            int k=0;
            for(int i=num;i<2*num;i+=2){
                System.out.print(i+" ");
            }
            System.out.println(k);
        }
    }
}


import java.util.ArrayList;
import java.util.Scanner;

public class KidSeating {
    private static Scanner scanner=new Scanner(System.in);
    public static void main(String[] args){
        int test=scanner.nextInt();
        for(int t=0;t<test;t++){
            int size=scanner.nextInt();
            int num=2*size;
            int k=0;
            for(int i=num;i<2*num;i+=2){
                System.out.print(i+" ");
            }
        }
    }
}


import java.util.ArrayList;
import java.util.Scanner;

public class KidSeating {
    private static Scanner scanner=new Scanner(System.in);
    public static void main(String[] args){
        int test=scanner.nextInt();
        for(int t=0;t<test;t++){
            int size=scanner.nextInt();
            int length=4*size;
            boolean prime[]=new boolean[length+1];
            for(int i=0;i<prime.length;i++){
                prime[i]=true;
            }
            for(int p=2;p*p<=length;p++){
                if(prime[p]){
                    for(int i=p*p;i<=length;i+=p){
                        prime[i]=false;
                    }
                }
            }
            int num=0;
            for(int i=2;i<=length&&num<size;i++){
                if(prime[i]){
                    System.out.print(2*i+" ");
                    num++;
                }
            }
            System.out.println();
        }
    }
}


import java.io.*;
import java.util.*;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    void solve(int TC) throws Exception {
    	int max = (int) 1e5;
    	ArrayList<Integer> al = new ArrayList<>();
        int[] pm = new int[max];
        for(int i=2;i<max;i++) {
        	if(pm[i]==0) {
        		al.add(i);
        		for(int j=i+i;j<max;j+=i) pm[j]=1;
        	}
        }
        int tc = ni();
        while(tc-->0) {
        	int n = ni();
        	for(int i=0;i<n;i++) {
        		p(al.get(i)*2+" ");
        	}
        	pn("");
        }

    }

    boolean TestCases = false;
    public static void main(String[] args) throws Exception { new Main().run(); }

    void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
    static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}

    void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        int T = TestCases ? ni() : 1;
        for(int t=1;t<=T;t++) solve(t);
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }

    void p(Object o) { out.print(o); }
    void pn(Object o) { out.println(o); }
    void pni(Object o) { out.println(o);out.flush(); }

    int ni() {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    double nd() { return Double.parseDouble(ns()); }
    char nc() { return (char)skip(); }

    int BUF_SIZE = 1024 * 8;
    byte[] inbuf = new byte[BUF_SIZE];
    int lenbuf = 0, ptrbuf = 0;

    int readByte() {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        } return inbuf[ptrbuf++];
    }

    boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

    String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))) {
            sb.appendCodePoint(b); b = readByte();
        } return sb.toString();
    }

    char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        } return n == p ? buf : Arrays.copyOf(buf, p);
    }

    void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }
}


import java.io.*;
import java.util.*;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    void solve(int TC) throws Exception {
    	int max = (int) 1e5;
    	ArrayList<Integer> al = new ArrayList<>();
        int[] pm = new int[max];
        for(int i=2;i<max;i++) {
        	if(pm[i]==0) {
        		al.add(i);
        		for(int j=i+i;j<max;j+=i) pm[j]=1;
        	}
        }
        int tc = ni();
        while(tc-->0) {
        	int n = ni();
        	ArrayList<Integer> ans = new ArrayList<>();
        	for(int i=0;i<n;i++) {
        		if(al.get(i)*2<=4*n) {
        			ans.add(al.get(i)*2);
        		}
        	}
        	int ad=2;
    		while(ans.size() < n) {
    			boolean ok = true;
    			for(int i: ans) {
    				if(ad%i==0 || i%ad==0) {
    					ok=false;
    					break;
    				}
    			}
    			if(ok) ans.add(ad);
    			++ad;
    		}
    		for(int i: ans) p(i + " ");
        	pn("");
        }

    }

    boolean TestCases = false;
    public static void main(String[] args) throws Exception { new Main().run(); }

    void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
    static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}

    void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        int T = TestCases ? ni() : 1;
        for(int t=1;t<=T;t++) solve(t);
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }

    void p(Object o) { out.print(o); }
    void pn(Object o) { out.println(o); }
    void pni(Object o) { out.println(o);out.flush(); }

    int ni() {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    double nd() { return Double.parseDouble(ns()); }
    char nc() { return (char)skip(); }

    int BUF_SIZE = 1024 * 8;
    byte[] inbuf = new byte[BUF_SIZE];
    int lenbuf = 0, ptrbuf = 0;

    int readByte() {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        } return inbuf[ptrbuf++];
    }

    boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

    String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))) {
            sb.appendCodePoint(b); b = readByte();
        } return sb.toString();
    }

    char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        } return n == p ? buf : Arrays.copyOf(buf, p);
    }

    void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }
}


import java.io.*;
import java.util.*;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    void solve(int TC) throws Exception {
        int tc = ni();
        while(tc-->0) {
            int n = ni();
        	ArrayList<Integer> ans = new ArrayList<>();
        	ans.add(2*n);
        	int ad = 2*n+2;
        	while(ans.size()<n){
        	    ans.add(ad);
        	    ad+=2;
        	}
        	for(int i: ans) p(i+" ");pn("");
        }
    }

    public long gcd(long a, long b) { return (b==0) ? a : gcd(b,a%b); }

    boolean TestCases = false;
    public static void main(String[] args) throws Exception { new Main().run(); }

    void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
    static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}

    void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        int T = TestCases ? ni() : 1;
        for(int t=1;t<=T;t++) solve(t);
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }

    void p(Object o) { out.print(o); }
    void pn(Object o) { out.println(o); }
    void pni(Object o) { out.println(o);out.flush(); }

    int ni() {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    double nd() { return Double.parseDouble(ns()); }
    char nc() { return (char)skip(); }

    int BUF_SIZE = 1024 * 8;
    byte[] inbuf = new byte[BUF_SIZE];
    int lenbuf = 0, ptrbuf = 0;

    int readByte() {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        } return inbuf[ptrbuf++];
    }

    boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

    String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))) {
            sb.appendCodePoint(b); b = readByte();
        } return sb.toString();
    }

    char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        } return n == p ? buf : Arrays.copyOf(buf, p);
    }

    void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }
}


import java.io.*;
import java.util.*;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    void solve(int TC) throws Exception {
    	int max = (int) 1e5;
    	ArrayList<Integer> al = new ArrayList<>();
        int[] pm = new int[max];
        for(int i=2;i<max;i++) {
        	if(pm[i]==0) {
        		al.add(i);
        		for(int j=i+i;j<max;j+=i) pm[j]=1;
        	}
        }
        int tc = ni();
        while(tc-->0) {
        	int n = ni();
        	ArrayList<Integer> ans = new ArrayList<>();
        	for(int i=0;i<n;i++) {
        		if(al.get(i)*2<=4*n) {
        			ans.add(al.get(i)*2);
        		}else break;
        	}
        	int ad=2;
    		while(ans.size() < n) {
    			boolean ok = true;
    			for(int i: ans) {
    				if(ad%i == 0 || i%ad == 0 || gcd(i, ad) == 1) {
    					ok = false;
    					break;
    				}
    			}
    			if(ok) ans.add(ad);
    			++ad;
    		}
    		for(int i: ans) p(i + " ");
        	pn("");
        }

    }

    public long gcd(long a, long b) { return (b==0) ? a : gcd(b,a%b); }

    boolean TestCases = false;
    public static void main(String[] args) throws Exception { new Main().run(); }

    void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
    static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}

    void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        int T = TestCases ? ni() : 1;
        for(int t=1;t<=T;t++) solve(t);
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }

    void p(Object o) { out.print(o); }
    void pn(Object o) { out.println(o); }
    void pni(Object o) { out.println(o);out.flush(); }

    int ni() {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    double nd() { return Double.parseDouble(ns()); }
    char nc() { return (char)skip(); }

    int BUF_SIZE = 1024 * 8;
    byte[] inbuf = new byte[BUF_SIZE];
    int lenbuf = 0, ptrbuf = 0;

    int readByte() {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        } return inbuf[ptrbuf++];
    }

    boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

    String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))) {
            sb.appendCodePoint(b); b = readByte();
        } return sb.toString();
    }

    char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        } return n == p ? buf : Arrays.copyOf(buf, p);
    }

    void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }
}


import java.io.*;
import java.util.*;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    void solve(int TC) throws Exception {
        int tc = ni();
        while(tc-->0) {
        	int n = ni();
        	ArrayList<Integer> ans = new ArrayList<>();
        	ans.add(4);
        	for(int i=4;ans.size()<n;i+=2){
        	    if(i%4==0) continue;
        	    boolean ok=true;
        	    for(int j: ans){
        	        if(i%j==0 || j%i==0 || gcd(i, j)==1) {ok=false;break;}
        	    }
        	    if(ok) ans.add(i);
        	}
    		for(int i: ans) p(i + " ");
        	pn("");
        }

    }

    public long gcd(long a, long b) { return (b==0) ? a : gcd(b,a%b); }

    boolean TestCases = false;
    public static void main(String[] args) throws Exception { new Main().run(); }

    void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
    static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}

    void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        int T = TestCases ? ni() : 1;
        for(int t=1;t<=T;t++) solve(t);
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }

    void p(Object o) { out.print(o); }
    void pn(Object o) { out.println(o); }
    void pni(Object o) { out.println(o);out.flush(); }

    int ni() {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        while(true) {
            if(b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    double nd() { return Double.parseDouble(ns()); }
    char nc() { return (char)skip(); }

    int BUF_SIZE = 1024 * 8;
    byte[] inbuf = new byte[BUF_SIZE];
    int lenbuf = 0, ptrbuf = 0;

    int readByte() {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        } return inbuf[ptrbuf++];
    }

    boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

    String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))) {
            sb.appendCodePoint(b); b = readByte();
        } return sb.toString();
    }

    char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        } return n == p ? buf : Arrays.copyOf(buf, p);
    }

    void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }
}


import java.io.*;
import java.util.*;

public class A {

	public static void main(String[] args) throws IOException{

		FastScanner fs = new FastScanner();
		boolean[] b = new boolean[401];
		Arrays.fill(b, true);
		for(int i=2 ; i<401 ; i++) {
			if(b[i]) {
				for(int j=2 ; i*j<401 ; j++) {
					b[i*j] = false;
				}
			}
		}
		int test = fs.nextInt();
		for(int i=0 ; i<test ; i++) {
			int n = fs.nextInt();
			int cnt = n;
			for(int j=2 ; j<401 && cnt>0 ; j++) {
				if(b[j]) {
					System.out.print(j*2 + " ");
					cnt--;
				}
			}
			System.out.println();
		}
	}

	public static int sod(int n) {
		int ans = 0;
		for(char c:String.valueOf(n).toCharArray()) {
			ans += Character.getNumericValue(c);
		}
		return ans;
	}

	public static long gcd(long a , long b) {
		if(a==0) return b;
		else return gcd(b%a,a);
	}

	static void sort(int[] a) {
		ArrayList<Integer> l=new ArrayList<>();
		for (int i:a) l.add(i);
		Collections.sort(l);
		for (int i=0; i<a.length; i++) a[i]=l.get(i);
	}

	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		String[] readStringArray(int n) {
			String[] a=new String[n];
			for (int i=0; i<n; i++) a[i]=next();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}

	static class Pair implements Comparable<Pair> {

        int x;
        int y;

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int hashCode() {
            return this.x ^ this.y;
        }

        @Override
        public boolean equals(Object obj) {
            if (this == obj)
                return true;
            if (obj == null)
                return false;
            if (getClass() != obj.getClass())
                return false;
            Pair other = (Pair) obj;
            if (x != other.x)
                return false;
            if (y != other.y)
                return false;
            return true;
        }
        @Override
        public int compareTo(Pair o) {
			if(x!=o.x)return x-o.x;
            return y-o.y;
        }
	}

}


import java.io.*;
import java.util.*;

public class A {

	public static void main(String[] args) throws IOException{

		FastScanner fs = new FastScanner();
		int test = fs.nextInt();
		for(int i=0 ; i<test ; i++) {
			int n = fs.nextInt();
			for(int j=2*n ; j<=4*n ; j+=2) {
				System.out.print(j + " ");
			}
			System.out.println();
		}
	}

	public static int sod(int n) {
		int ans = 0;
		for(char c:String.valueOf(n).toCharArray()) {
			ans += Character.getNumericValue(c);
		}
		return ans;
	}

	public static long gcd(long a , long b) {
		if(a==0) return b;
		else return gcd(b%a,a);
	}

	static void sort(int[] a) {
		ArrayList<Integer> l=new ArrayList<>();
		for (int i:a) l.add(i);
		Collections.sort(l);
		for (int i=0; i<a.length; i++) a[i]=l.get(i);
	}

	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		String[] readStringArray(int n) {
			String[] a=new String[n];
			for (int i=0; i<n; i++) a[i]=next();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}

	static class Pair implements Comparable<Pair> {

        int x;
        int y;

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int hashCode() {
            return this.x ^ this.y;
        }

        @Override
        public boolean equals(Object obj) {
            if (this == obj)
                return true;
            if (obj == null)
                return false;
            if (getClass() != obj.getClass())
                return false;
            Pair other = (Pair) obj;
            if (x != other.x)
                return false;
            if (y != other.y)
                return false;
            return true;
        }
        @Override
        public int compareTo(Pair o) {
			if(x!=o.x)return x-o.x;
            return y-o.y;
        }
	}

}


import java.io.*;
import java.util.*;

public class A {

	public static void main(String[] args) throws IOException{

		FastScanner fs = new FastScanner();
		int test = fs.nextInt();
		for(int i=0 ; i<test ; i++) {
			int n = fs.nextInt();
			for(int j=2*n ; j<4*n ; j+=2) {
				System.out.print(j + " ");
			}
			System.out.println();
		}
	}

	public static int sod(int n) {
		int ans = 0;
		for(char c:String.valueOf(n).toCharArray()) {
			ans += Character.getNumericValue(c);
		}
		return ans;
	}

	public static long gcd(long a , long b) {
		if(a==0) return b;
		else return gcd(b%a,a);
	}

	static void sort(int[] a) {
		ArrayList<Integer> l=new ArrayList<>();
		for (int i:a) l.add(i);
		Collections.sort(l);
		for (int i=0; i<a.length; i++) a[i]=l.get(i);
	}

	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		String[] readStringArray(int n) {
			String[] a=new String[n];
			for (int i=0; i<n; i++) a[i]=next();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}

	static class Pair implements Comparable<Pair> {

        int x;
        int y;

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int hashCode() {
            return this.x ^ this.y;
        }

        @Override
        public boolean equals(Object obj) {
            if (this == obj)
                return true;
            if (obj == null)
                return false;
            if (getClass() != obj.getClass())
                return false;
            Pair other = (Pair) obj;
            if (x != other.x)
                return false;
            if (y != other.y)
                return false;
            return true;
        }
        @Override
        public int compareTo(Pair o) {
			if(x!=o.x)return x-o.x;
            return y-o.y;
        }
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class b {
    public static void main(String[] args) {
        FastScanner fs = new FastScanner();
        int T = fs.nextInt();

        try{
            for (int tt = 0; tt < T; tt++) {
                int n=fs.nextInt();
                for(int i=4*n,j=0;i>2*n &&j<n;i-=1,j++)
                    System.out.print(i+" ");
                System.out.println();

            }}
        catch(Exception e){
            return;
        }

    }

    static void sort(int[] a) {
        ArrayList<Integer> l=new ArrayList<>();
        for (int i:a) l.add(i);
        Collections.sort(l);
        for (int i=0; i<a.length; i++) a[i]=l.get(i);
    }
    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class b {
    public static void main(String[] args) {
        FastScanner fs = new FastScanner();
        int T = fs.nextInt();

        try{
            for (int tt = 0; tt < T; tt++) {
                int n=fs.nextInt();
                for(int i=4*n,j=0;i>=2*n+2 &&j<n;i-=2,j++)
                    System.out.print(i+" ");
                System.out.println();

            }}
        catch(Exception e){
            return;
        }

    }

    static void sort(int[] a) {
        ArrayList<Integer> l=new ArrayList<>();
        for (int i:a) l.add(i);
        Collections.sort(l);
        for (int i=0; i<a.length; i++) a[i]=l.get(i);
    }
    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class b {

    public static void main(String[] args) {
        FastScanner fs=new FastScanner();
        int T=fs.nextInt();

        for (int tt=0; tt<T; tt++) {
            int n = fs.nextInt();
            if (n == 1){
                System.out.println(1);
                continue;}
            if(n==2){
                System.out.println("4 6");
                continue;}
            else if (n % 2 != 0){
                int k = n+1;
                System.out.print(n+1+" ");
                for (int i = n + 1, j=0; i < 4 * n && j< n; i += 2) {
                    if (i % k != 0){
                        if(j==n-1)
                            System.out.println(i);
                        else
                         System.out.print(i +" ");
                        j++;}

                }

            }

            else {
                int k=2*n;
                System.out.print(2*n+" ");
                for (int i =2*n ,j=0; i < 4 * n && j<n; i+=2){
                    if (i % k!= 0) {
                        if (j == n - 1)
                            System.out.println(i);
                        else
                            System.out.print(i + " ");
                    j++;}
                }
            }
            System.out.println();
        }

    }

    static void sort(int[] a) {
        ArrayList<Integer> l=new ArrayList<>();
        for (int i:a) l.add(i);
        Collections.sort(l,Collections.reverseOrder());
        for (int i=0; i<a.length; i++) a[i]=l.get(i);
    }
    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }

}


import java.util.*;

public class A681div2 {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int t = scan.nextInt();
		while(t-- > 0) {
			int n = scan.nextInt();

			int cur = 2;
			for(int i = 0; i < n; i++) {
				System.out.print(cur + " ");
				cur+=2;
			}
			System.out.println();
		}

	}

}


import java.util.*;

public class A681div2 {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int t = scan.nextInt();
		while(t-- > 0) {
			int n = scan.nextInt();

			int cur = 4*n;
			for(int i = 0; i < n; i++) {
				System.out.print(cur + " ");
				cur-=2;
			}
			System.out.println();
		}

	}

}


import java.util.ArrayList;
import java.util.Scanner;

public class A681 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner obj=new Scanner(System.in);
		int t=obj.nextInt();
		while(t-->0)
		{
			//long p=obj.nextLong();
			int n=obj.nextInt();
			ArrayList<Integer> arr=new ArrayList<>();
			int k=n;
			for(int i=(n+1)*2;i<=4*k;i+=2)
			{
				System.out.print(i+" ");

			}
//			for(int j=0;j<arr.size();j++)
//			System.out.println(arr.get(j)+" ");
			System.out.println();
		}

	}
	static long gcd(long n1, long n2) {
        long gcd = 1;
        for (int i = 1; i <= n1 && i <= n2; ++i) {
            if (n1 % i == 0 && n2 % i == 0) {
                gcd = i;
            }
        }
        return gcd;
    }

}


import java.util.Scanner;

public class A681 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner obj=new Scanner(System.in);
		int t=obj.nextInt();
		while(t-->0)
		{
			//long p=obj.nextLong();
			int n=obj.nextInt();
			//int arr=new int[n];
			for(int i=0;i<n;i++)
			{
				System.out.print(i+1+" ");
			}
			System.out.println();
		}

	}

}


import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

    public class Codeforcesb {

        public static void main(String[] args) throws IOException {
           Scanner sc = new Scanner(System.in);
           int t = sc.nextInt();
           while(t-- >0){
               int n = sc.nextInt();
               if(n == 1) System.out.print(4);
               else{
               int count = 0;
               List<Integer> list = new ArrayList<>();
               list.add(4 * n);
               int index = 0;
               for(int i = 4 * n; i >= 2; i -= 2){
                   boolean Possible = true;
                   for(int j = 0; j <= index; j++){
                       if(list.get(j) % i == 0 || i % list.get(j) == 0){
                           Possible = false;
                           break;
                       }
                   }
                   if(Possible){
                       list.add(i);
                       index++;
                       if(list.size() == n) break;
                   }
               }
               for(int i = 0; i < list.size(); i++){
                   System.out.print(list.get(i) +" ");
               }
            }
               System.out.println();
           }
                  }
        }


import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

    public class Codeforcesb {

        public static void main(String[] args) throws IOException {
           Scanner sc = new Scanner(System.in);
           int t = sc.nextInt();
           while(t-- >0){
               int n = sc.nextInt();
               if(n == 1) System.out.print(2);
               else{
               int count = 0;
               List<Integer> list = new ArrayList<>();
               list.add(4);
               int index = 0;
               for(int i = 6; i <= 4 * n; i+= 2){
                   boolean Possible = true;
                   for(int j = 0; j <= index; j++){
                       if(list.get(j) % i == 0 || i % list.get(j) == 0){
                           Possible = false;
                           break;
                       }
                   }
                   if(Possible){
                       list.add(i);
                       index++;
                       if(list.size() == n) break;
                   }
               }
               for(int i = 0; i < list.size(); i++){
                   System.out.print(list.get(i) +" ");
               }
            }
               System.out.println();
           }
                  }
        }


import java.util.*;
public class solution1 {
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int t=s.nextInt();
		for(int tt=0;tt<t;tt++){
			int n=s.nextInt();
			int ans=4;
			System.out.print(ans+" ");
			while(n!=1) {
				ans=ans+2;
				if((ans/2)%2!=0) {
					n--;
					System.out.print(ans+" ");
				}
			}
			System.out.println();
		}
	    s.close();
	}
	public static String inttobinary(int n) {
		String customString = Integer.toString(n, 2);
	    return customString;
	}
}


import java.util.*;
public class solution1 {
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int t=s.nextInt();
		for(int tt=0;tt<t;tt++){
			int n=s.nextInt();
			int ans=2*n;
			while(n!=0) {
				n--;
				System.out.print(ans+" ");
				ans=ans+2;
			}
			System.out.println();
		}
	    s.close();
	}
	public static String inttobinary(int n) {
		String customString = Integer.toString(n, 2);
	    return customString;
	}
}


import java.util.*;
public class  trial{

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		@SuppressWarnings("resource")
		Scanner sc=new Scanner(System.in);
		int t=0;
		t=sc.nextInt();
		while(t>0) {
			t--;
			int m=4;
			int n=sc.nextInt();
			m=n*2;
			int arr[]=new int[n];
			for(int i=0;i<n;i++) {
				arr[i]=m;
					m+=2;
			}
			for(int i=0;i<n;i++) {
				System.out.print(arr[i]+" ");
			}
			System.out.println();
		}
	}

}


import java.util.*;
public class  trial{

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		@SuppressWarnings("resource")
		Scanner sc=new Scanner(System.in);
		int t=0;
		t=sc.nextInt();
		while(t>0) {
			t--;
			int m=4;
			int n=sc.nextInt();
			int arr[]=new int[n];
			for(int i=0;i<n;i++) {
				arr[i]=m;
				if(i==0)
					m+=2;
				else
					m+=4;
			}
			for(int i=0;i<n;i++) {
				System.out.print(arr[i]+" ");
			}
			System.out.println();
		}
	}

}


import java.util.*;
public class  trial{

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		@SuppressWarnings("resource")
		Scanner sc=new Scanner(System.in);
		int t=0;
		t=sc.nextInt();
		while(t>0) {
			t--;
			int m=102;
			int n=sc.nextInt();
			int arr[]=new int[n];
			for(int i=0;i<n;i++) {
				arr[i]=m;
				m+=2;
			}
			for(int i=0;i<n;i++) {
				System.out.print(arr[i]+" ");
			}
			System.out.println();
		}
	}

}


import java.util.*;
public class  trial{

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		@SuppressWarnings("resource")
		Scanner sc=new Scanner(System.in);
		int t=0;
		t=sc.nextInt();
		while(t>0) {
			t--;
			int m=2;
			int n=sc.nextInt();
			int arr[]=new int[n];
			for(int i=0;i<n;i++) {
				arr[i]=m;
				m+=2;
			}
			for(int i=0;i<n;i++) {
				System.out.print(arr[i]+" ");
			}
			System.out.println();
		}
	}

}


import java.io.*;
import java.util.*;
public class HelloWorld{
     public static void main(String []args){
        Scanner scn = new Scanner(System.in);
        int q = scn.nextInt();
        for(int t=0;t<q;t++){
            int n = scn.nextInt();
            for(int i=3;i<4*n;i++){
                if(i%4 == 2 || i == 4){
                    System.out.print(i+" ");
                }
            }
            System.out.println();
        }
     }
}


import java.io.*;
import java.util.*;
public class HelloWorld{
     public static void main(String []args){
        Scanner scn = new Scanner(System.in);
        int q = scn.nextInt();
        for(int t=0;t<q;t++){
            int n = scn.nextInt();
            for(int i=4*n;i>2*n;i-=2){
                    System.out.print(i+" ");
            }
            System.out.println();
        }
     }
}


import java.util.Scanner;
import java.util.Arrays;
public class CF681div2A {
    public static int[] a = new int[100];
    public static int[] vis = new int[10000000];
    public static boolean check(int x){
        for(int i = 2;i*i<=x;i++){
            if(x%i==0)
                return false;
        }
        return true;
    }

    public static void get_Prime(){
        int cnt = 0;
        for(int i = 2;;i++) {
            if (cnt == 100) break;
            if (check(i)) a[cnt++] = i;
        }
    }
    public static void main(String args[]){
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        get_Prime();
        for(int i = 0;i<n;i++){
            Arrays.fill(vis,0);
            int k = cin.nextInt();
            int w = k;
            int delta = 2;
            int cnt = k;
            while(cnt>0){
                for(int j = 0;j<k;j++) {
                    if(a[j]*delta>4*w||cnt<=0){
                        delta++;
                        break;
                    }
                    if(vis[a[j]*delta]==0) {
                        System.out.printf("%d ", a[j] * delta);
                        vis[a[j] * delta] = 1;
                        cnt--;
                    }

                }
            }
            System.out.println("");
        }
    }

}


import java.util.Scanner;
import java.util.Arrays;
public class CF681div2A {
    public static void main(String args[]){
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        for(int i = 0;i<n;i++){
            int k = cin.nextInt();
            int temp = 2*k;
            for(int j=0;j<k;j++){
                System.out.printf("%d ",temp);
                temp+=2;
            }
            System.out.println("");
        }
    }

}


import java.util.Scanner;
import java.util.Arrays;
public class CF681div2A {
    public static void main(String args[]){
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        for(int i = 0;i<n;i++){
            int k = cin.nextInt();
            for(int j=0;j<k;j++){
                System.out.printf("%d ",j*2+2*n);
            }
            System.out.println("");
        }
    }

}


import java.util.Scanner;
public class CF681div2A {
    public static int[] a = new int[100];
    public static boolean check(int x){
        for(int i = 2;i*i<=x;i++){
            if(x%i==0)
                return false;
        }
        return true;
    }

    public static void get_Prime(){
        int cnt = 0;
        for(int i = 2;;i++) {
            if (cnt == 100) break;
            if (check(i)) a[cnt++] = i;
        }
    }

    public static void main(String args[]){
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        get_Prime();
        for(int i = 0;i<n;i++){
            int k = cin.nextInt();
            for(int j = 0;j<k;j++) {
                System.out.printf("%d ", a[j] * 2);
            }
            System.out.println("");
        }
    }

}


import java.util.Scanner;
public class CF681div2A {
    public static void main(String args[]){
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        for(int i = 0;i<n;i++){
            int k = cin.nextInt();
            for(int j = 1;j<=k;j++){
                System.out.printf("%d ",j*2);
            }
            System.out.println("\n");
        }
    }

}


import java.util.Scanner;
public class CF681div2A {
    public static void main(String args[]){
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        for(int i = 0;i<n;i++){
            int k = cin.nextInt();
            for(int j = 1;j<=k;j++) {
                System.out.printf("%d ", j * 2);
            }
            System.out.println("");
        }
    }

}


//package cp;

import java.util.*;
import java.io.*;

public class Solution
{
	public static void main(String[] args)
	{
		FastScanner sc = new FastScanner();
		int t = sc.nextInt();
		while(t-- >0) {
			int n = sc.nextInt();
			for(int i=1 ; i<=n ; i++) {
				System.out.print(2*i+" ");
			}
			System.out.println();
		}
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
		int [] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}


//package cp;

import java.util.*;
import java.io.*;

public class Solution
{
	public static void main(String[] args)
	{
		FastScanner sc = new FastScanner();
		int t = sc.nextInt();
		while(t-- >0) {
			int n = sc.nextInt();
			int m=4*n;
			for(int i=1 ; i<=n ; i++) {
				System.out.print(m+" ");
				m = m-2;
			}
			System.out.println();
		}
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
		int [] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}


//package cp;

import java.util.*;
import java.io.*;

public class Solution
{
	public static void main(String[] args)
	{
		FastScanner sc = new FastScanner();
		int t = sc.nextInt();
		while(t-- >0) {
			int n = sc.nextInt();
			for(int i=0 ; i<n-1 ; i++) {
				System.out.print(2 * i + 4+" ");
			}
			System.out.print(4*(n-1) + 2);
			System.out.println();
		}
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
		int [] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}


//package cp;

import java.util.*;
import java.io.*;

public class Solution
{
	public static void main(String[] args)
	{
		FastScanner sc = new FastScanner();
		int t = sc.nextInt();
		while(t-- >0) {
			int n = sc.nextInt();
			for(int i=1 ; i<=n ; i++) {
				System.out.print(4*i+" ");
			}
			System.out.println();
		}
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
		int [] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}


import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Test
{

    static int gcd(int a, int b)
    {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    public static void main(String[] args)
    {
       Scanner sc=new Scanner(System.in);
       int t=sc.nextInt();
       for(int i=1;i<=t;i++){
           int n=sc.nextInt();
           List<Integer> list=new ArrayList<>();
           for(int j=1;j<=4*n;j++){

               for(int k=j+1;k<=4*n;k++){
                   if(gcd(j,k)==1 || j%k==0|| k%j==0){
                   }else{
                       int flag1=0;
                       int flag2=0;
                       for (Integer integer:list){
                           if( gcd(j,integer)==1 || j%integer==0|| integer%j==0 || gcd(k,integer)==1 || k%integer==0|| integer%k==0){
                               flag1=1;

                           }
                           if( gcd(k,integer)==1 || k%integer==0|| integer%k==0){
                               flag2=1;
                           }
                           if(flag1==1 && flag2==1){
                               break;
                           }
                       }
                       if (flag1==0){
                           list.add(j);

                       }
                       if (flag2==0){
                           list.add(k);
                       }

                   }
               }

           }
           for(Integer integer:list){
               System.out.print(integer+" ");
           }
       }
    }
}


import java.util.*;

public class Test
{

    static int gcd(int a, int b)
    {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    public static void main(String[] args)
    {
       Scanner sc=new Scanner(System.in);
       int t=sc.nextInt();
       for(int i=1;i<=t;i++){
           int n=sc.nextInt();
           List<Integer> list=new ArrayList<>();
           int k=4*n;
           for(int j=1;j<=n;j++){
                 list.add(k);
                 k=k-2;

           }

           for(Integer integer:list){
               System.out.print(integer+" ");
           }

       }
    }
}


import java.util.*;

public class Test
{

    static int gcd(int a, int b)
    {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    public static void main(String[] args)
    {
       Scanner sc=new Scanner(System.in);
       int t=sc.nextInt();
       for(int i=1;i<=t;i++){
           int n=sc.nextInt();
           List<Integer> list=new ArrayList<>();
           int k=4*n;
           for(int j=1;j<=n;j++){
                 list.add(k);
                 k=k-2;

           }

           for(Integer integer:list){
               System.out.print(integer+" ");
           }
           System.out.println("\n"+list.size());
       }
    }
}


import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Test
{

    static int gcd(int a, int b)
    {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    public static void main(String[] args)
    {
       Scanner sc=new Scanner(System.in);
       int t=sc.nextInt();
       for(int i=1;i<=t;i++){
           int n=sc.nextInt();
           List<Integer> list=new ArrayList<>();
           for(int j=1;j<=4*n;j++){

               for(int k=j+1;k<=4*n;k++){
                   if(gcd(j,k)==1 || j%k==0|| k%j==0){
                   }else{
                       int flag1=0;
                       int flag2=0;
                       for (Integer integer:list){
                           if(gcd(j,integer)==1 || j%integer==0|| integer%j==0 || gcd(k,integer)==1 || k%integer==0|| integer%k==0){
                               flag1=1;

                           }
                           if( gcd(k,integer)==1 || k%integer==0|| integer%k==0){
                               flag2=1;
                           }
                       }
                       if (flag1==0){
                           list.add(j);

                       }
                       if (flag2==0){
                           list.add(k);
                       }

                   }
               }

           }
           for(Integer integer:list){
               System.out.print(integer+" ");
           }
       }
    }
}


import java.util.Scanner;

public class KidsSeating {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int tc;
        tc = in.nextInt();
        for(int i=0;i<tc;i++){
            int n,t=0;
            n = in.nextInt();
            for(int j=4*n;j>=0;j=j-2)
            {
                System.out.print(j+" ");
                t++;
                if(t==n)
                    break;;
            }
            System.out.println();

        }
    }
}


import java.util.Scanner;

public class KidsSeating {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int tc;
        tc = in.nextInt();
        for(int i=0;i<tc;i++){
            int n,t=0;
            n = in.nextInt();
            for(int j=4*n;j>=0;j=j-2)
            {
                System.out.print(k+" ");
                t++;
                if(t==n)
                    break;;
            }
            System.out.println();

        }
    }
}


import java.util.*;
public class ECR96{

	private static Scanner scan;

	public static void main(String args[]) {

		scan = new Scanner(System.in);
		int t = scan.nextInt();
		while(t-->0) {
			int n  = scan.nextInt();
			int count =0;
			for(int i =2;count<n;i+=2) {
				System.out.print(i+" ");
				count++;
			}
			System.out.println();
		}
	}
}


import java.util.*;
public class ECR96{

	private static Scanner scan;

	public static void main(String args[]) {

		scan = new Scanner(System.in);
		int t = scan.nextInt();
		while(t-->0) {
			int n  = scan.nextInt();
			int count =0;
			for(int i =4*n;count<n;i-=2) {
				System.out.print(i+" ");
				count++;
			}
			System.out.println();
		}
	}
}