#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
 
using namespace std;
 
#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
 
const int INF = 10000000;

int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};

string s;
string t = "AIZUNYAN", u = "AIDUNYAN";
vi w(26, 0);

bool calc(int n){
	vi v(26, 0);
	for(int i = 0; i < 8 && i + n < s.size(); i++) v[s[i + n]-'A']++;
	for(int i = 0; i < 26; i++){
		if(v[i] != w[i]) return false;; 
	}
	for(int i = 0; i < 8; i++){
		s[i + n] = t[i];
	}
	return true;
}


int main(){
	for(int i = 0; i < u.size(); i++) w[u[i]-'A']++;
	cin>>s;
	for(int i = 0; i < s.size(); i++) {
		bool f = calc(i);
		if(f) i += 7;
	}
	cout<<s<<endl;
}