Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
)
var out = bufio.NewWriter(os.Stdout)

func main(){
	defer out.Flush()
	for i:=1; i<10; i++{
		for j:=1; j<10; j++{
			fmt.Fprintf(out, "%dx%d=%d\n", i, j, i*j)
		}
	}
}

C++: #include<iostream>
using namespace std;

int main(){
    for( int i = 1; i < 10; i++){
        for( int j = 1; j < 10; j++){
            cout << i << 'x' << j << '=' << i * j << endl;
        }
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
	for (int i = 1; i <= 9; i++){
		for (int n = 1; n <= 9; n++){
			cout << i << "x" << n << endl;
		}
		}

}

C++: #include <bits/stdc++.h>
using namespace std;

int main()
{
	// std::auto_ptr<int> p;
	std::unique_ptr<int> q;
	std::shared_ptr<int> r;
}

C++: #include<bits/stdc++.h>
using namespace std;


int main(){
	for(int i=1;i<=9;i++){
		cout<<i<<'*'<<i<<'='<<i*i<<endl;
	}
	return 0;
}

C++: #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include<iostream>
using namespace std;

int main(){
    for(int i=1;i<=9;i++)
        for(int j=1;j<=9;j++)
    {
        printf("%d*%d=%d\n",i,j,i*j);
    }

    return 0;
}

C++: using System.Collections;
using System.Collections.Generic;

int main(){

		for (int i = 1; i <= 9; i++) {

			for (int j = 1; j <= 9; j++) {

				int re = i * j;
Console.WriteLine(re);

			}
		}
}

C++: #include<iostream>
using namespace std;

int main(){
	for(int i=1;i<10;++i){
		for(int j=1;j<10;++j){
			cout<<i<<'x'<<j<<endl;
		}
	}
    return 0;
}

C++: #include <stdio.h>
 
int main(){
for(int i = 1; i < 10; i++){
for(int j = 1; j < 10; j++){
printf("%dx%d=%d\n",i,j,i*j);
}
}
}

C++: #include <iostream>

using namespace std;

int main(void){
    for(int i=1;i < 10;i ++){
        for(int j=1;j < 10;j ++){
            cout << i << "x" << j << "=" << i * j << endl;
        }
    }
    return 0;
}

C++: #include<iostream>
using namespace std;

int main(void){
	for(int i=0;i<10;i++)
		for(int j=0;j<10;j++)
			cout<<i<<"x"<<j<<"="<<i*j<<endl;

}

C++: #include <stdio.h>

int main()
{
    int i,j;
    for(i=1;i<10;i++)
    {
        for(j=1;j<10;j++)
        {
            printf("%dx%d=%d\n",i,j,i*j);
        }
    }
    return 0;

}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };


int main() {
#ifdef _DEBUG
	printf( "debug\n" );
#endif
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 1; j < 10; j++ ) {
			printf( "%dx%d=%d\n", i, j, i +j );
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	for (int i = 1; i <= 9; i++)
		for (int j = i; j <= 9; j++)
			cout << i << '*' << j << '=' << i*j << endl;
	return 0;
}

C++: #include<stdio.h>
 
int main(){
int i ,j;
for(i = 1;i<10;i++){
for(j = 1;j<10;j++){
printf("%d*%d=%d",i,j(i*j));
}
}
 
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
  for(int i=1; i<10; i++){
    for(int j=1; j<10; j++){
      cout<<i<<"x"<<j<<endl;
    }
  }
  return 0;
}

C++: #include<iostream>
using namespace std;

int main() {
	for (int i = 0; i < 81; i++) {
		cout << i / 9 + 1 << "x" << i % 9 + 1 << "=" << i + 1 << endl;
	}

	return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <iostream>
#include <set>

using namespace std ;

#define sz(x) ((int)x.size())

multiset<int> MX,MI ;

int n , x;
char op[10] ;
int _ ;

int main()
{
    freopen("input.txt","r",stdin);
    scanf("%d",&_);
    while (_--)
    {
        MX.clear() ;
        MI.clear() ;
        scanf("%d",&n) ;
        for (int i = 0 ; i < n ; i++)
        {
            scanf("%s%d",op,&x) ;
            int sz1 = (int)MX.size() , sz2 = (int)MI.size() ;
            int node ;
            if (op[0] == 'a')
            {
                if (sz1 == 0){
                    MX.insert(x) ;
                }else if (sz2 < sz1)  // add to sz2
                {
                    node = (*MX.begin()) ;
                    if (x <= node) MI.insert(x) ;
                    else
                    {
                        if (sz(MI) != 0)
                        {
                            multiset<int>::iterator it = (--MI.end()) ;
                            node = *it ;
                            MI.erase(it) ;
                            MI.insert(x);
                            MX.insert(node) ;
                        }else{

                        }
                    }
                }
                else
                {
                    int node = (*MX.begin()) ;
                    if (x >= node) MX.insert(x) ;
                    else
                    {
                        if (sz(MI) != 0)
                        {
                            multiset<int>::iterator it = (--MI.end()) ;
                            node = *it ;
                            MI.erase(it) ;
                            MI.insert(x);
                            MX.insert(node) ;
                        }else
                            MI.insert(x);
                    }
                }
            }else{
                if (MX.find(x) != MX.end()){

                    MX.erase(MX.find(x)) ;
                    if (sz(MX) != sz(MI)){
                        multiset<int>::iterator it = (--MI.end()) ;
                        node = *it ;
                        MI.erase(it) ;
                        MX.insert(node) ;
                    }

                }else if (MI.find(x) != MI.end()){

                    MI.erase(MI.find(x)) ;
                    if (sz(MX) != sz(MI)+1){
                        multiset<int>::iterator it = (--MX.begin()) ;
                        node = *it ;
                        MX.erase(it) ;
                        MX.insert(node) ;
                    }

                }else{
                    printf("Wrong!\n") ;
                    continue ;
                }
            }
            if (sz(MI) + sz(MX) == 0) printf("Empty!\n");
            else{
                int tot = sz(MI) + sz(MX) ;
                if (tot & 1) printf("%d\n",*(MX.begin()));
                else printf("%.1f\n",((*MX.begin())+(*(--MI.end())))/2.0);
            }
        }
    }
    return 0 ;
}

C++: #include <stdio.h>

int main()
{
    int i, j;
    for(i=1; i<10; i++)
        {
            for(j=1; j<10; j++)
            {
            printf("%dx%d=%d\n", i,j,i*j);
            }
        }

    return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
for(int i = 1;i <=  9;i++){
{for(int j = 1;j <=  9;j++){
std::cout << i << "x" << j << "=" << i*j << std::endl;
}
}
    return 0;
}