#include<bits/stdc++.h>
using namespace std;
#define fo(i,k,n) for(long long i=k;i<n;i++)
#define endl "\n"
#define pb push_back
#define vii vector<ll>
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second

typedef long long ll;

ll fun_ceil(ll n,ll k){
    if(n%k==0){
        return n/k;
    }
    else {
        ll x = (n/k)+1;
        return x;
    }
} 

ll pw(ll n, ll pow, ll m){
    if(pow==0)return 1;
    if(pow%2 == 0){ll x = pw(n, pow/2, m);
        return (x*x)%m;}
    else return (pw(n, pow-1, m)*n)%m;
}
ll gcd(ll a, ll b) {
    if (!b)return a;
    return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
    return (a * b) / gcd(a, b);
}
ll fact(ll n, ll mod) {
    if (n > 1)
        return (n * fact(n - 1, mod)) % mod;
    else
        return 1;
}
bool isPrime(ll n) {
    if (n <= 3) {
        return true;
    }
    if (n % 2 == 0 || n % 3 == 0) {
        return false;
    }
    for (ll i = 5; i * i <= n; i = i + 6) {
        if (n % i == 0 || n % (i + 2) == 0) {
            return false;
        }
    }
    return true;
}
//sort(s.begin(),s.end(),[](tt x, tt y){return abs(x)>abs(y);});

void calc(){
    string s;cin>>s;
    char t1 = s[0], t2 = s[1];
    s[0] = s[1];
    s[1] = s[2];
    s[2] = t1;
    cout<<s;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    
        calc();
    
    return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n;
    cin >> n;
    ll mx = -1, mn = 1e15;
    ll arr[n+1];
    for(int i = 1; i <= n; i++) {
        cin >> arr[i];
        mx = max(mx, arr[i]);
        mn = min(mn, arr[i]);
    }
    unordered_map<ll, ll> arr1;
    //memset(arr1, 0, sizeof(arr1));
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= sqrt(arr[i]) && j < mn; j++)   {
            if(arr[i]%j == 0)   {
                arr1[j] = __gcd(arr1[j], arr[i]);
                if(arr[i]/j < mn)   {
                    arr1[arr[i]/j] = __gcd(arr1[arr[i]/j], arr[i]);
                }
            }
        }
    }
    ll ans = 1;
    for(auto itr = arr1.begin(); itr != arr1.end(); itr++)  {
        if(itr->first == itr->second)   {
            ans++;
        }
    }
    cout << ans;
    
}
