本题不需要考虑公元前的,我们只需要对应求公元后的方法即可。\\ 用年份除以十得到的余数再减三为天干的序数,用年份除以十二得到的余数再减三为地支序数,如1987年,得到的序数分别为4,4。所以该年为丁卯。只要知道这个公式这题就很简单了。

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
# include<bits/stdc++.h>
# include<unordered_map>

# define eps 1e-9
# define fi first
# define se second
# define ll long long
# define int ll
# define x1 sb
# define y1 dsb
# define x2 ssb
# define y2 ddsb
// cout<<fixed<<setprecision(n) 
//bool operator<(const Node& x )
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int > PII; 
const int mod=998244353;
const int N=2e5+10;
const int Time=86400;
const int X=131;
const int inf=0x3f3f3f3f;
const double PI = 1e-4;
double pai = 3.14159265358979323846; 
double e = exp(1);

int T,n,m,k,t,maxn,ans,p;

void solve(){
         while(cin >> n){
		 	int a = n % 10 -3 ;
		 	if(a <= 0) a+=10;
		 	int b = n % 12 - 3 ;
		 	if(b <= 0) b+=12;
		 	cout<<a<<" "<<b<<"\n";
		 }
}	  
/*
1 10 20 20 30 
*/
signed main(){  
    std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); 
    
      //cin >> T;
    T = 1;
    while(T--){
		solve();
	} 
    return 0; 
}