#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdlib>

using namespace std;

#define ALL(c) c.begin(),c.end()
#define RALL(c) c.rbegin(),c.rend()
#define REP(type,i,n) for(type i=0;i<(n);++i)
#define MP(a,b) make_pair((a),(b))
#define F_ first
#define S_ second

typedef long long int lli;
typedef pair<int,int> Pi;

const int INF=100000000;
const long long int INF_=1000000000000000000;

string str="AIDUNY";
int t[6]={2,1,1,1,2,1};

int main(){
	string Z;
	cin >> Z;
	vector<map<char,int> > s(Z.size());
	REP(int,i,Z.size()){
		if(i!=0) REP(int,j,6) s[i][str[j]]=s[i-1][str[j]];
		int idx=str.find(Z[i]);
		if(idx!=string::npos){
			++s[i][str[idx]];
		}
	}
	vector<map<char,int> > s_(Z.size());
	for(int i=7; i<Z.size(); ++i){
		REP(int,j,6){
			if(i==7) s_[i][str[j]]=s[i][str[j]];
			else s_[i][str[j]]=s[i][str[j]]-s[i-8][str[j]];
		}
	}
	for(int i=7; i<Z.size(); ++i){
		bool flag=true;
		REP(int,j,6){
			if(s_[i][str[j]]!=t[j]){
				flag=false;
				break;
			}
		}
		if(flag){
			Z.replace(i-7,8,"AIZUNYAN");
		}
	}
	cout << Z << endl;
	return 0;
}