高精度加法（进制）

/*
    高精度进制加法
    n为进制（n<=36）  
*/
#include<bits/stdc++.h>
using namespace std;
const int maxn=10000;
int n;
struct bign{
    int d[maxn],len;
    inline bign(){len=1;memset(d,0,sizeof(d));}
    inline bign operator = (const char* num)
    {
        memset(d,0,sizeof(d));
        len=strlen(num);
        for(int i=0;i<len;i++)
        {
            if(num[len-1-i]>'9') d[i]=10+num[len-i-1]-'A';
            else d[i]=num[len-i-1]-48;
        }
        return *this;
    }
    inline bign operator + (const bign &b)
    {
        bign c;
        int x=0,i,lenmax=max(len,b.len);
        for(i=0;i<lenmax;i++)
        {
            c.d[i]=d[i]+b.d[i]+x;
            x=c.d[i]/n;
            c.d[i]%=n;
        }
        x?c.d[i]=i:i--;
        c.len=i+1;
        return c;
    }
    inline string str () const
    {
        char s[maxn]={};
        for(int i=0;i<len;i++)
        {
            if(d[len-i-1]>9) s[i]='A'+d[len-i-1]-10;
            else s[i]=d[len-i-1]+48;
        }
        return s;
    }
}a,b;
inline istream& operator >> (istream &in,bign &x)
{
    char s[maxn]={};
    in>>s;
    x=s;
    return in;
}
inline ostream& operator << (ostream &out,const bign &x)
{
    out<<x.str();
    return out;
}
int main()
{
    cin>>n>>a>>b;
    cout<<a+b;
    return 0;
}